./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/lcp.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 17e6e52dd20f9be422d05cd630fd9252ae3011a2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:06:42,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:06:42,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:06:42,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:06:42,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:06:42,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:06:42,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:06:42,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:06:42,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:06:42,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:06:42,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:06:42,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:06:42,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:06:42,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:06:42,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:06:42,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:06:42,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:06:42,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:06:42,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:06:42,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:06:42,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:06:42,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:06:42,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:06:42,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:06:42,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:06:42,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:06:42,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:06:42,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:06:42,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:06:42,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:06:42,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:06:42,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:06:42,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:06:42,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:06:42,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:06:42,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:06:42,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:06:42,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:06:42,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:06:42,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:06:42,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:06:42,988 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:06:43,003 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:06:43,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:06:43,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:06:43,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:06:43,005 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:06:43,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:06:43,006 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:06:43,006 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:06:43,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:06:43,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:06:43,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:06:43,007 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:06:43,007 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:06:43,008 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:06:43,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:06:43,008 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:06:43,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:06:43,009 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:06:43,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:06:43,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:06:43,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:06:43,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:06:43,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:06:43,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:06:43,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:06:43,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:06:43,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:06:43,011 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:06:43,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17e6e52dd20f9be422d05cd630fd9252ae3011a2 [2019-11-28 20:06:43,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:06:43,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:06:43,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:06:43,321 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:06:43,322 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:06:43,323 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/lcp.c [2019-11-28 20:06:43,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8043a2354/137b26ce99b84c9ca9bc47a0f415f43a/FLAGdf756a00f [2019-11-28 20:06:43,831 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:06:43,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2019-11-28 20:06:43,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8043a2354/137b26ce99b84c9ca9bc47a0f415f43a/FLAGdf756a00f [2019-11-28 20:06:44,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8043a2354/137b26ce99b84c9ca9bc47a0f415f43a [2019-11-28 20:06:44,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:06:44,198 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:06:44,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:06:44,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:06:44,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:06:44,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:06:44" (1/1) ... [2019-11-28 20:06:44,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c44cb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:44, skipping insertion in model container [2019-11-28 20:06:44,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:06:44" (1/1) ... [2019-11-28 20:06:44,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:06:44,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:06:44,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:06:44,416 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:06:44,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:06:44,525 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:06:44,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:44 WrapperNode [2019-11-28 20:06:44,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:06:44,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:06:44,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:06:44,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:06:44,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:44" (1/1) ... [2019-11-28 20:06:44,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:44" (1/1) ... [2019-11-28 20:06:44,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:44" (1/1) ... [2019-11-28 20:06:44,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:44" (1/1) ... [2019-11-28 20:06:44,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:44" (1/1) ... [2019-11-28 20:06:44,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:44" (1/1) ... [2019-11-28 20:06:44,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:44" (1/1) ... [2019-11-28 20:06:44,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:06:44,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:06:44,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:06:44,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:06:44,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:06:44,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:06:44,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:06:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-28 20:06:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2019-11-28 20:06:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-28 20:06:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:06:44,631 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 20:06:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:06:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:06:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:06:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-28 20:06:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:06:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-28 20:06:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2019-11-28 20:06:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:06:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-28 20:06:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:06:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:06:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 20:06:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:06:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:06:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:06:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:06:45,059 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:06:45,060 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 20:06:45,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:06:45 BoogieIcfgContainer [2019-11-28 20:06:45,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:06:45,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:06:45,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:06:45,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:06:45,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:06:44" (1/3) ... [2019-11-28 20:06:45,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf5b90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:06:45, skipping insertion in model container [2019-11-28 20:06:45,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:44" (2/3) ... [2019-11-28 20:06:45,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf5b90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:06:45, skipping insertion in model container [2019-11-28 20:06:45,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:06:45" (3/3) ... [2019-11-28 20:06:45,069 INFO L109 eAbstractionObserver]: Analyzing ICFG lcp.c [2019-11-28 20:06:45,079 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:06:45,087 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-28 20:06:45,099 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-28 20:06:45,120 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:06:45,120 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:06:45,121 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:06:45,121 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:06:45,121 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:06:45,121 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:06:45,121 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:06:45,121 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:06:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-28 20:06:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:06:45,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:45,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:45,151 INFO L410 AbstractCegarLoop]: === Iteration 1 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:45,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:45,157 INFO L82 PathProgramCache]: Analyzing trace with hash 992921340, now seen corresponding path program 1 times [2019-11-28 20:06:45,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:45,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305638201] [2019-11-28 20:06:45,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:45,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305638201] [2019-11-28 20:06:45,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:45,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:06:45,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312247404] [2019-11-28 20:06:45,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:06:45,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:45,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:06:45,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:06:45,495 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 8 states. [2019-11-28 20:06:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:45,955 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-11-28 20:06:45,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:06:45,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-28 20:06:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:45,966 INFO L225 Difference]: With dead ends: 60 [2019-11-28 20:06:45,967 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 20:06:45,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:06:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 20:06:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-28 20:06:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 20:06:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-28 20:06:46,028 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 16 [2019-11-28 20:06:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:46,029 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-28 20:06:46,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:06:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-28 20:06:46,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:06:46,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:46,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:46,032 INFO L410 AbstractCegarLoop]: === Iteration 2 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:46,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash 992921341, now seen corresponding path program 1 times [2019-11-28 20:06:46,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:46,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548360674] [2019-11-28 20:06:46,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:46,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548360674] [2019-11-28 20:06:46,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:46,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:06:46,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670743069] [2019-11-28 20:06:46,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:06:46,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:46,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:06:46,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:06:46,335 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 10 states. [2019-11-28 20:06:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:46,957 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-28 20:06:46,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:06:46,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-28 20:06:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:46,961 INFO L225 Difference]: With dead ends: 70 [2019-11-28 20:06:46,962 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 20:06:46,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:06:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 20:06:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2019-11-28 20:06:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 20:06:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-28 20:06:46,972 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-11-28 20:06:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:46,973 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-28 20:06:46,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:06:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-28 20:06:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:06:46,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:46,974 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:46,975 INFO L410 AbstractCegarLoop]: === Iteration 3 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:46,975 INFO L82 PathProgramCache]: Analyzing trace with hash 715790491, now seen corresponding path program 1 times [2019-11-28 20:06:46,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:46,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55870238] [2019-11-28 20:06:46,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:47,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55870238] [2019-11-28 20:06:47,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:47,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:06:47,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627300014] [2019-11-28 20:06:47,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:06:47,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:47,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:06:47,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:06:47,224 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 10 states. [2019-11-28 20:06:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:47,821 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-28 20:06:47,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:06:47,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-28 20:06:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:47,824 INFO L225 Difference]: With dead ends: 69 [2019-11-28 20:06:47,824 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 20:06:47,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:06:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 20:06:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-28 20:06:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 20:06:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-28 20:06:47,833 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 17 [2019-11-28 20:06:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:47,834 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-28 20:06:47,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:06:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-28 20:06:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:06:47,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:47,836 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:47,836 INFO L410 AbstractCegarLoop]: === Iteration 4 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash 688616144, now seen corresponding path program 1 times [2019-11-28 20:06:47,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:47,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973447943] [2019-11-28 20:06:47,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:47,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973447943] [2019-11-28 20:06:47,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:47,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:06:47,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383944463] [2019-11-28 20:06:47,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:06:47,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:47,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:06:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:06:47,907 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-28 20:06:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:48,085 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-11-28 20:06:48,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:06:48,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 20:06:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:48,087 INFO L225 Difference]: With dead ends: 61 [2019-11-28 20:06:48,088 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 20:06:48,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:06:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 20:06:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-28 20:06:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 20:06:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-28 20:06:48,104 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 19 [2019-11-28 20:06:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:48,104 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-28 20:06:48,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:06:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-28 20:06:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:06:48,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:48,106 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:48,106 INFO L410 AbstractCegarLoop]: === Iteration 5 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:48,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:48,111 INFO L82 PathProgramCache]: Analyzing trace with hash -333529585, now seen corresponding path program 1 times [2019-11-28 20:06:48,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:48,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015676611] [2019-11-28 20:06:48,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:48,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015676611] [2019-11-28 20:06:48,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149436452] [2019-11-28 20:06:48,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:48,442 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 20:06:48,450 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:48,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:06:48,522 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:48,530 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:48,531 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:06:48,531 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 20:06:48,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:48,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:48,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:06:48,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-28 20:06:48,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554189095] [2019-11-28 20:06:48,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 20:06:48,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:48,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 20:06:48,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:06:48,798 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 19 states. [2019-11-28 20:06:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:49,566 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-11-28 20:06:49,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:06:49,566 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-11-28 20:06:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:49,568 INFO L225 Difference]: With dead ends: 69 [2019-11-28 20:06:49,568 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 20:06:49,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2019-11-28 20:06:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 20:06:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-28 20:06:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 20:06:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-28 20:06:49,575 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 22 [2019-11-28 20:06:49,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:49,575 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-28 20:06:49,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 20:06:49,575 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-28 20:06:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:06:49,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:49,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:49,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:49,782 INFO L410 AbstractCegarLoop]: === Iteration 6 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:49,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:49,784 INFO L82 PathProgramCache]: Analyzing trace with hash -578852278, now seen corresponding path program 1 times [2019-11-28 20:06:49,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:49,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003899940] [2019-11-28 20:06:49,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:49,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003899940] [2019-11-28 20:06:49,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:49,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:06:49,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322322635] [2019-11-28 20:06:49,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:06:49,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:49,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:06:49,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:06:49,896 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 9 states. [2019-11-28 20:06:50,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:50,202 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-28 20:06:50,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:06:50,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-28 20:06:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:50,205 INFO L225 Difference]: With dead ends: 69 [2019-11-28 20:06:50,205 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 20:06:50,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:06:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 20:06:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-28 20:06:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 20:06:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-28 20:06:50,211 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 23 [2019-11-28 20:06:50,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:50,211 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-28 20:06:50,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:06:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-28 20:06:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:06:50,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:50,212 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:50,212 INFO L410 AbstractCegarLoop]: === Iteration 7 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:50,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:50,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1749482551, now seen corresponding path program 1 times [2019-11-28 20:06:50,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:50,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309828829] [2019-11-28 20:06:50,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:50,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309828829] [2019-11-28 20:06:50,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746378091] [2019-11-28 20:06:50,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:50,455 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 20:06:50,460 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:50,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:06:50,470 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:50,478 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:50,479 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:06:50,480 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 20:06:50,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:50,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:50,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:06:50,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-28 20:06:50,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91472558] [2019-11-28 20:06:50,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 20:06:50,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:50,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 20:06:50,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:06:50,713 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 19 states. [2019-11-28 20:06:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:51,586 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-28 20:06:51,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:06:51,586 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-11-28 20:06:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:51,588 INFO L225 Difference]: With dead ends: 64 [2019-11-28 20:06:51,588 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 20:06:51,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-11-28 20:06:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 20:06:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-28 20:06:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 20:06:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-28 20:06:51,595 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 23 [2019-11-28 20:06:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:51,596 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-28 20:06:51,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 20:06:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-28 20:06:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 20:06:51,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:51,597 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:51,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:51,805 INFO L410 AbstractCegarLoop]: === Iteration 8 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:51,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:51,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156168, now seen corresponding path program 1 times [2019-11-28 20:06:51,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:51,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608911650] [2019-11-28 20:06:51,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:06:51,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608911650] [2019-11-28 20:06:51,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:51,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:06:51,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806171152] [2019-11-28 20:06:51,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:06:51,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:51,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:06:51,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:06:51,922 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 8 states. [2019-11-28 20:06:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:52,238 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-28 20:06:52,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:06:52,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-28 20:06:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:52,241 INFO L225 Difference]: With dead ends: 57 [2019-11-28 20:06:52,241 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 20:06:52,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:06:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 20:06:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-28 20:06:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 20:06:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-28 20:06:52,247 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 29 [2019-11-28 20:06:52,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:52,247 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-28 20:06:52,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:06:52,247 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-28 20:06:52,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 20:06:52,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:52,248 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:52,249 INFO L410 AbstractCegarLoop]: === Iteration 9 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:52,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:52,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156167, now seen corresponding path program 1 times [2019-11-28 20:06:52,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:52,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005393379] [2019-11-28 20:06:52,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:52,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005393379] [2019-11-28 20:06:52,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492470304] [2019-11-28 20:06:52,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:52,676 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 20:06:52,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:52,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:06:52,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:52,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:52,695 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:06:52,696 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 20:06:52,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:52,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:55,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:06:55,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-28 20:06:55,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469189005] [2019-11-28 20:06:55,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 20:06:55,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:55,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 20:06:55,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-11-28 20:06:55,172 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 26 states. [2019-11-28 20:06:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:58,741 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-11-28 20:06:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 20:06:58,742 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-11-28 20:06:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:58,744 INFO L225 Difference]: With dead ends: 61 [2019-11-28 20:06:58,744 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 20:06:58,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=260, Invalid=1461, Unknown=1, NotChecked=0, Total=1722 [2019-11-28 20:06:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 20:06:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2019-11-28 20:06:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 20:06:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-11-28 20:06:58,751 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 29 [2019-11-28 20:06:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:58,752 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-11-28 20:06:58,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 20:06:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-11-28 20:06:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 20:06:58,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:58,753 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:58,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:58,958 INFO L410 AbstractCegarLoop]: === Iteration 10 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:58,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:58,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1740200963, now seen corresponding path program 1 times [2019-11-28 20:06:58,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:58,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695672657] [2019-11-28 20:06:58,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:06:59,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695672657] [2019-11-28 20:06:59,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818330302] [2019-11-28 20:06:59,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:06:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:59,293 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 20:06:59,296 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:59,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:06:59,303 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:06:59,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:06:59,315 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:06:59,315 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 20:06:59,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:06:59,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:01,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:07:01,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-28 20:07:01,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048917690] [2019-11-28 20:07:01,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 20:07:01,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:01,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 20:07:01,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-11-28 20:07:01,767 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 26 states. [2019-11-28 20:07:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:03,380 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-11-28 20:07:03,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 20:07:03,381 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-11-28 20:07:03,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:03,383 INFO L225 Difference]: With dead ends: 58 [2019-11-28 20:07:03,383 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 20:07:03,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=260, Invalid=1461, Unknown=1, NotChecked=0, Total=1722 [2019-11-28 20:07:03,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 20:07:03,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-11-28 20:07:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 20:07:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-11-28 20:07:03,389 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2019-11-28 20:07:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:03,389 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-11-28 20:07:03,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 20:07:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-11-28 20:07:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 20:07:03,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:03,391 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:03,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:03,595 INFO L410 AbstractCegarLoop]: === Iteration 11 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:03,596 INFO L82 PathProgramCache]: Analyzing trace with hash 35373901, now seen corresponding path program 1 times [2019-11-28 20:07:03,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:03,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021054368] [2019-11-28 20:07:03,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:07:03,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021054368] [2019-11-28 20:07:03,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942024593] [2019-11-28 20:07:03,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:03,853 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-28 20:07:03,857 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:03,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:07:03,868 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:03,873 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:03,873 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:03,873 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 20:07:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:04,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:07:04,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-11-28 20:07:04,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763604952] [2019-11-28 20:07:04,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:07:04,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:04,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:07:04,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:07:04,314 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 13 states. [2019-11-28 20:07:04,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:04,779 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-28 20:07:04,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:07:04,780 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-11-28 20:07:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:04,781 INFO L225 Difference]: With dead ends: 56 [2019-11-28 20:07:04,781 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:07:04,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-11-28 20:07:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:07:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-11-28 20:07:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:07:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-28 20:07:04,786 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 38 [2019-11-28 20:07:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:04,787 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-28 20:07:04,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:07:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-28 20:07:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 20:07:04,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:04,789 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:04,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:04,997 INFO L410 AbstractCegarLoop]: === Iteration 12 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:04,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:04,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1096590900, now seen corresponding path program 1 times [2019-11-28 20:07:04,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:04,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79700724] [2019-11-28 20:07:04,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:07:05,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79700724] [2019-11-28 20:07:05,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204462855] [2019-11-28 20:07:05,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:05,237 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-28 20:07:05,241 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:05,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:07:05,247 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:05,253 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:05,254 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:05,254 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 20:07:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:05,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:07:05,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-11-28 20:07:05,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657182335] [2019-11-28 20:07:05,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:07:05,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:05,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:07:05,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:07:05,701 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 13 states. [2019-11-28 20:07:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:06,124 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-11-28 20:07:06,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:07:06,125 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-28 20:07:06,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:06,126 INFO L225 Difference]: With dead ends: 55 [2019-11-28 20:07:06,126 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 20:07:06,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-11-28 20:07:06,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 20:07:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-28 20:07:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 20:07:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-28 20:07:06,131 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 39 [2019-11-28 20:07:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:06,132 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-28 20:07:06,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:07:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-28 20:07:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 20:07:06,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:06,134 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:06,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:06,341 INFO L410 AbstractCegarLoop]: === Iteration 13 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:06,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1566484332, now seen corresponding path program 1 times [2019-11-28 20:07:06,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:06,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620819114] [2019-11-28 20:07:06,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:07:06,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620819114] [2019-11-28 20:07:06,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:06,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:07:06,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764137706] [2019-11-28 20:07:06,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:07:06,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:07:06,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:07:06,408 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 6 states. [2019-11-28 20:07:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:06,551 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-28 20:07:06,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:07:06,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-28 20:07:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:06,552 INFO L225 Difference]: With dead ends: 52 [2019-11-28 20:07:06,552 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 20:07:06,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:07:06,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 20:07:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-28 20:07:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:07:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-11-28 20:07:06,555 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 41 [2019-11-28 20:07:06,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:06,556 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-11-28 20:07:06,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:07:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-11-28 20:07:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 20:07:06,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:06,557 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:06,557 INFO L410 AbstractCegarLoop]: === Iteration 14 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:06,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:06,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2142076529, now seen corresponding path program 1 times [2019-11-28 20:07:06,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:06,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477017440] [2019-11-28 20:07:06,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:07:06,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477017440] [2019-11-28 20:07:06,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:06,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:07:06,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799545529] [2019-11-28 20:07:06,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:07:06,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:06,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:07:06,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:07:06,672 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2019-11-28 20:07:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:06,827 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-11-28 20:07:06,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:07:06,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-28 20:07:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:06,828 INFO L225 Difference]: With dead ends: 51 [2019-11-28 20:07:06,828 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:07:06,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:07:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:07:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:07:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:07:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:07:06,830 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-28 20:07:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:06,830 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:07:06,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:07:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:07:06,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:07:06,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:07:06 BoogieIcfgContainer [2019-11-28 20:07:06,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:07:06,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:07:06,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:07:06,837 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:07:06,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:06:45" (3/4) ... [2019-11-28 20:07:06,840 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:07:06,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 20:07:06,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lcp [2019-11-28 20:07:06,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 20:07:06,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-28 20:07:06,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-28 20:07:06,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-28 20:07:06,852 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-28 20:07:06,852 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 20:07:06,853 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 20:07:06,853 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:07:06,903 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:07:06,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:07:06,905 INFO L168 Benchmark]: Toolchain (without parser) took 22707.11 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.1 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:06,905 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:06,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:06,906 INFO L168 Benchmark]: Boogie Preprocessor took 50.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:06,906 INFO L168 Benchmark]: RCFGBuilder took 484.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:06,910 INFO L168 Benchmark]: TraceAbstraction took 21773.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.2 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:06,910 INFO L168 Benchmark]: Witness Printer took 66.83 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:06,912 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 484.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21773.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.2 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. * Witness Printer took 66.83 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 30]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 63 locations, 16 error locations. Result: SAFE, OverallTime: 21.7s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 434 SDtfs, 1604 SDslu, 754 SDs, 0 SdLazy, 4253 SolverSat, 447 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 185 SyntacticMatches, 14 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 44 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 546 ConstructedInterpolants, 78 QuantifiedInterpolants, 132425 SizeOfPredicates, 68 NumberOfNonLiveVariables, 914 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 25/49 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...