./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6692e4fc 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/duplets.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash c261d11d6e37ef6eda45455c8074b5a0eac3352b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:25:27,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:25:27,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:25:27,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:25:27,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:25:27,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:25:27,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:25:27,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:25:27,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:25:27,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:25:27,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:25:27,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:25:27,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:25:27,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:25:27,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:25:27,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:25:27,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:25:27,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:25:27,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:25:27,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:25:27,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:25:27,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:25:27,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:25:27,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:25:27,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:25:27,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:25:27,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:25:27,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:25:27,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:25:27,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:25:27,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:25:27,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:25:27,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:25:27,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:25:27,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:25:27,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:25:27,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:25:27,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:25:27,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:25:27,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:25:27,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:25:27,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-25 17:25:27,232 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:25:27,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:25:27,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:25:27,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:25:27,234 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:25:27,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:25:27,235 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:25:27,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:25:27,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:25:27,236 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:25:27,236 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:25:27,236 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:25:27,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:25:27,237 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:25:27,237 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:25:27,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:25:27,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:25:27,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:25:27,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:25:27,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:25:27,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:25:27,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:25:27,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:25:27,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:25:27,240 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-11-25 17:25:27,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:25:27,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:25:27,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:25:27,623 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:25:27,624 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:25:27,624 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2019-11-25 17:25:27,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4537e07d/cd9fcb66c08c4250aec8d5737dc5b00e/FLAG8447586a7 [2019-11-25 17:25:28,101 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:25:28,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-11-25 17:25:28,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4537e07d/cd9fcb66c08c4250aec8d5737dc5b00e/FLAG8447586a7 [2019-11-25 17:25:28,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4537e07d/cd9fcb66c08c4250aec8d5737dc5b00e [2019-11-25 17:25:28,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:25:28,522 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:25:28,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:25:28,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:25:28,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:25:28,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:25:28" (1/1) ... [2019-11-25 17:25:28,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3740c10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:28, skipping insertion in model container [2019-11-25 17:25:28,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:25:28" (1/1) ... [2019-11-25 17:25:28,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:25:28,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:25:28,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:25:28,758 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:25:28,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:25:28,859 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:25:28,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:28 WrapperNode [2019-11-25 17:25:28,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:25:28,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:25:28,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:25:28,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:25:28,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:28" (1/1) ... [2019-11-25 17:25:28,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:28" (1/1) ... [2019-11-25 17:25:28,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:28" (1/1) ... [2019-11-25 17:25:28,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:28" (1/1) ... [2019-11-25 17:25:28,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:28" (1/1) ... [2019-11-25 17:25:28,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:28" (1/1) ... [2019-11-25 17:25:28,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:28" (1/1) ... [2019-11-25 17:25:28,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:25:28,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:25:28,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:25:28,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:25:28,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:28" (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-25 17:25:29,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:25:29,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:25:29,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-25 17:25:29,032 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-11-25 17:25:29,032 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-11-25 17:25:29,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:25:29,032 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 17:25:29,033 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:25:29,034 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:25:29,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 17:25:29,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-25 17:25:29,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:25:29,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-25 17:25:29,035 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-11-25 17:25:29,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 17:25:29,036 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-11-25 17:25:29,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 17:25:29,036 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:25:29,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:25:29,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 17:25:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 17:25:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:25:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:25:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:25:29,622 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:25:29,622 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-25 17:25:29,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:25:29 BoogieIcfgContainer [2019-11-25 17:25:29,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:25:29,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:25:29,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:25:29,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:25:29,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:25:28" (1/3) ... [2019-11-25 17:25:29,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1285468c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:25:29, skipping insertion in model container [2019-11-25 17:25:29,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:25:28" (2/3) ... [2019-11-25 17:25:29,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1285468c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:25:29, skipping insertion in model container [2019-11-25 17:25:29,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:25:29" (3/3) ... [2019-11-25 17:25:29,632 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-25 17:25:29,639 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:25:29,645 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2019-11-25 17:25:29,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2019-11-25 17:25:29,678 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:25:29,678 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:25:29,678 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:25:29,679 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:25:29,679 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:25:29,679 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:25:29,679 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:25:29,679 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:25:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-11-25 17:25:29,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 17:25:29,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:29,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:29,713 INFO L410 AbstractCegarLoop]: === Iteration 1 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:29,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash -115732399, now seen corresponding path program 1 times [2019-11-25 17:25:29,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:29,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557972735] [2019-11-25 17:25:29,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:30,054 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-25 17:25:30,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557972735] [2019-11-25 17:25:30,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:30,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:25:30,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039716407] [2019-11-25 17:25:30,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:25:30,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:30,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:25:30,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:25:30,083 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 8 states. [2019-11-25 17:25:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:30,805 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-11-25 17:25:30,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:25:30,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-25 17:25:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:30,822 INFO L225 Difference]: With dead ends: 103 [2019-11-25 17:25:30,822 INFO L226 Difference]: Without dead ends: 100 [2019-11-25 17:25:30,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:25:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-25 17:25:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-25 17:25:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-25 17:25:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-25 17:25:30,907 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 14 [2019-11-25 17:25:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:30,907 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-25 17:25:30,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:25:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-25 17:25:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 17:25:30,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:30,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:30,911 INFO L410 AbstractCegarLoop]: === Iteration 2 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:30,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash -115732398, now seen corresponding path program 1 times [2019-11-25 17:25:30,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:30,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096729896] [2019-11-25 17:25:30,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:31,164 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-25 17:25:31,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096729896] [2019-11-25 17:25:31,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:31,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:25:31,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439322618] [2019-11-25 17:25:31,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:25:31,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:31,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:25:31,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:25:31,168 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 8 states. [2019-11-25 17:25:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:31,685 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-25 17:25:31,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:25:31,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-25 17:25:31,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:31,687 INFO L225 Difference]: With dead ends: 99 [2019-11-25 17:25:31,688 INFO L226 Difference]: Without dead ends: 99 [2019-11-25 17:25:31,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:25:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-25 17:25:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-25 17:25:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-25 17:25:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-11-25 17:25:31,700 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 14 [2019-11-25 17:25:31,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:31,700 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-11-25 17:25:31,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:25:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-11-25 17:25:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 17:25:31,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:31,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:31,702 INFO L410 AbstractCegarLoop]: === Iteration 3 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:31,702 INFO L82 PathProgramCache]: Analyzing trace with hash 707263019, now seen corresponding path program 1 times [2019-11-25 17:25:31,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:31,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489247421] [2019-11-25 17:25:31,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:31,845 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-25 17:25:31,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489247421] [2019-11-25 17:25:31,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:31,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:25:31,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294936] [2019-11-25 17:25:31,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:25:31,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:31,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:25:31,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:25:31,848 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 8 states. [2019-11-25 17:25:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:32,406 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-25 17:25:32,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:25:32,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-25 17:25:32,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:32,410 INFO L225 Difference]: With dead ends: 98 [2019-11-25 17:25:32,411 INFO L226 Difference]: Without dead ends: 98 [2019-11-25 17:25:32,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:25:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-25 17:25:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-25 17:25:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-25 17:25:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-25 17:25:32,433 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 15 [2019-11-25 17:25:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:32,433 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-25 17:25:32,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:25:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-25 17:25:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 17:25:32,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:32,436 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-25 17:25:32,438 INFO L410 AbstractCegarLoop]: === Iteration 4 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:32,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:32,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745985, now seen corresponding path program 1 times [2019-11-25 17:25:32,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:32,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899973741] [2019-11-25 17:25:32,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:32,609 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-25 17:25:32,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899973741] [2019-11-25 17:25:32,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:32,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 17:25:32,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209367572] [2019-11-25 17:25:32,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:25:32,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:32,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:25:32,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:25:32,613 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 8 states. [2019-11-25 17:25:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:33,061 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-25 17:25:33,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:25:33,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-25 17:25:33,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:33,063 INFO L225 Difference]: With dead ends: 96 [2019-11-25 17:25:33,064 INFO L226 Difference]: Without dead ends: 96 [2019-11-25 17:25:33,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:25:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-25 17:25:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-25 17:25:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-25 17:25:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-25 17:25:33,085 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 23 [2019-11-25 17:25:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:33,086 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-25 17:25:33,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:25:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-25 17:25:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 17:25:33,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:33,089 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-25 17:25:33,089 INFO L410 AbstractCegarLoop]: === Iteration 5 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:33,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745986, now seen corresponding path program 1 times [2019-11-25 17:25:33,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:33,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107308947] [2019-11-25 17:25:33,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:33,394 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-25 17:25:33,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107308947] [2019-11-25 17:25:33,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:33,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 17:25:33,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882760993] [2019-11-25 17:25:33,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:25:33,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:33,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:25:33,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:25:33,398 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 11 states. [2019-11-25 17:25:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:34,331 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2019-11-25 17:25:34,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 17:25:34,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-25 17:25:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:34,333 INFO L225 Difference]: With dead ends: 116 [2019-11-25 17:25:34,333 INFO L226 Difference]: Without dead ends: 116 [2019-11-25 17:25:34,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-11-25 17:25:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-25 17:25:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2019-11-25 17:25:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-25 17:25:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-11-25 17:25:34,343 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 23 [2019-11-25 17:25:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:34,343 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-11-25 17:25:34,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:25:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-11-25 17:25:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 17:25:34,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:34,344 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, 1] [2019-11-25 17:25:34,345 INFO L410 AbstractCegarLoop]: === Iteration 6 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1149583382, now seen corresponding path program 1 times [2019-11-25 17:25:34,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:34,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449838841] [2019-11-25 17:25:34,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:34,566 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-25 17:25:34,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449838841] [2019-11-25 17:25:34,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:34,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-25 17:25:34,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305511803] [2019-11-25 17:25:34,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 17:25:34,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:34,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 17:25:34,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:25:34,569 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 12 states. [2019-11-25 17:25:35,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:35,458 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2019-11-25 17:25:35,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 17:25:35,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-11-25 17:25:35,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:35,460 INFO L225 Difference]: With dead ends: 99 [2019-11-25 17:25:35,460 INFO L226 Difference]: Without dead ends: 99 [2019-11-25 17:25:35,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-11-25 17:25:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-25 17:25:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-25 17:25:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-25 17:25:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-11-25 17:25:35,470 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 24 [2019-11-25 17:25:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:35,470 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-11-25 17:25:35,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 17:25:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-11-25 17:25:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 17:25:35,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:35,472 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, 1, 1, 1] [2019-11-25 17:25:35,472 INFO L410 AbstractCegarLoop]: === Iteration 7 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:35,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash 943033910, now seen corresponding path program 1 times [2019-11-25 17:25:35,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:35,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079573070] [2019-11-25 17:25:35,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:35,595 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-25 17:25:35,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079573070] [2019-11-25 17:25:35,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:35,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:25:35,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590246810] [2019-11-25 17:25:35,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:25:35,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:35,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:25:35,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:25:35,598 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2019-11-25 17:25:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:35,894 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-11-25 17:25:35,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:25:35,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-25 17:25:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:35,896 INFO L225 Difference]: With dead ends: 94 [2019-11-25 17:25:35,896 INFO L226 Difference]: Without dead ends: 94 [2019-11-25 17:25:35,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:25:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-25 17:25:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-11-25 17:25:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-25 17:25:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-11-25 17:25:35,904 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 26 [2019-11-25 17:25:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:35,904 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-11-25 17:25:35,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:25:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-11-25 17:25:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 17:25:35,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:35,906 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, 1, 1, 1] [2019-11-25 17:25:35,907 INFO L410 AbstractCegarLoop]: === Iteration 8 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:35,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:35,907 INFO L82 PathProgramCache]: Analyzing trace with hash 943033911, now seen corresponding path program 1 times [2019-11-25 17:25:35,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:35,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879920163] [2019-11-25 17:25:35,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:36,034 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-25 17:25:36,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879920163] [2019-11-25 17:25:36,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:36,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:25:36,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451328698] [2019-11-25 17:25:36,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:25:36,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:36,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:25:36,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:25:36,037 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 7 states. [2019-11-25 17:25:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:36,417 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-11-25 17:25:36,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:25:36,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-25 17:25:36,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:36,419 INFO L225 Difference]: With dead ends: 89 [2019-11-25 17:25:36,419 INFO L226 Difference]: Without dead ends: 89 [2019-11-25 17:25:36,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:25:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-25 17:25:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-11-25 17:25:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-25 17:25:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-11-25 17:25:36,440 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 26 [2019-11-25 17:25:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:36,441 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-11-25 17:25:36,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:25:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-11-25 17:25:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 17:25:36,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:36,444 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] [2019-11-25 17:25:36,445 INFO L410 AbstractCegarLoop]: === Iteration 9 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:36,447 INFO L82 PathProgramCache]: Analyzing trace with hash 941830451, now seen corresponding path program 1 times [2019-11-25 17:25:36,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:36,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952930964] [2019-11-25 17:25:36,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:36,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952930964] [2019-11-25 17:25:36,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305554238] [2019-11-25 17:25:36,572 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-25 17:25:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:36,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 17:25:36,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:36,702 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-25 17:25:36,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:25:36,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2019-11-25 17:25:36,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163678460] [2019-11-25 17:25:36,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:25:36,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:36,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:25:36,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:25:36,710 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 5 states. [2019-11-25 17:25:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:36,785 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-11-25 17:25:36,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:25:36,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-25 17:25:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:36,788 INFO L225 Difference]: With dead ends: 112 [2019-11-25 17:25:36,789 INFO L226 Difference]: Without dead ends: 112 [2019-11-25 17:25:36,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:25:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-25 17:25:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2019-11-25 17:25:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-25 17:25:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-11-25 17:25:36,805 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 26 [2019-11-25 17:25:36,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:36,806 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-11-25 17:25:36,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:25:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-11-25 17:25:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 17:25:36,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:36,809 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, 1, 1, 1, 1] [2019-11-25 17:25:37,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:37,017 INFO L410 AbstractCegarLoop]: === Iteration 10 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:37,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:37,018 INFO L82 PathProgramCache]: Analyzing trace with hash -830719863, now seen corresponding path program 1 times [2019-11-25 17:25:37,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:37,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564996070] [2019-11-25 17:25:37,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:37,119 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-25 17:25:37,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564996070] [2019-11-25 17:25:37,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:37,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:25:37,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24781406] [2019-11-25 17:25:37,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:25:37,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:25:37,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:25:37,122 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 7 states. [2019-11-25 17:25:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:37,440 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-11-25 17:25:37,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:25:37,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-25 17:25:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:37,442 INFO L225 Difference]: With dead ends: 88 [2019-11-25 17:25:37,442 INFO L226 Difference]: Without dead ends: 88 [2019-11-25 17:25:37,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:25:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-25 17:25:37,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-25 17:25:37,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-25 17:25:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-11-25 17:25:37,455 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 27 [2019-11-25 17:25:37,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:37,455 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-11-25 17:25:37,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:25:37,456 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-11-25 17:25:37,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 17:25:37,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:37,458 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, 1, 1, 1, 1] [2019-11-25 17:25:37,458 INFO L410 AbstractCegarLoop]: === Iteration 11 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:37,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:37,460 INFO L82 PathProgramCache]: Analyzing trace with hash -830719862, now seen corresponding path program 1 times [2019-11-25 17:25:37,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:37,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684813658] [2019-11-25 17:25:37,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:37,569 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-25 17:25:37,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684813658] [2019-11-25 17:25:37,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:37,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 17:25:37,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335245682] [2019-11-25 17:25:37,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:25:37,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:37,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:25:37,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:25:37,576 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 7 states. [2019-11-25 17:25:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:37,900 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-11-25 17:25:37,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:25:37,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-25 17:25:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:37,901 INFO L225 Difference]: With dead ends: 83 [2019-11-25 17:25:37,901 INFO L226 Difference]: Without dead ends: 83 [2019-11-25 17:25:37,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:25:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-25 17:25:37,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-25 17:25:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-25 17:25:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-11-25 17:25:37,905 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 27 [2019-11-25 17:25:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:37,906 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-11-25 17:25:37,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:25:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-11-25 17:25:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 17:25:37,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:37,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:37,907 INFO L410 AbstractCegarLoop]: === Iteration 12 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash 48801308, now seen corresponding path program 1 times [2019-11-25 17:25:37,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:37,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242354502] [2019-11-25 17:25:37,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:37,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242354502] [2019-11-25 17:25:37,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255219805] [2019-11-25 17:25:37,995 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-25 17:25:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:38,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 17:25:38,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:38,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:25:38,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-11-25 17:25:38,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831177184] [2019-11-25 17:25:38,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 17:25:38,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:38,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 17:25:38,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:25:38,067 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 9 states. [2019-11-25 17:25:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:38,489 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-11-25 17:25:38,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 17:25:38,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-25 17:25:38,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:38,491 INFO L225 Difference]: With dead ends: 122 [2019-11-25 17:25:38,491 INFO L226 Difference]: Without dead ends: 122 [2019-11-25 17:25:38,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-11-25 17:25:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-25 17:25:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2019-11-25 17:25:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-25 17:25:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-11-25 17:25:38,502 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 31 [2019-11-25 17:25:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:38,502 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-11-25 17:25:38,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 17:25:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-11-25 17:25:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 17:25:38,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:38,504 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:38,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:38,709 INFO L410 AbstractCegarLoop]: === Iteration 13 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1425745197, now seen corresponding path program 2 times [2019-11-25 17:25:38,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:38,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233585617] [2019-11-25 17:25:38,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:38,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233585617] [2019-11-25 17:25:38,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017310557] [2019-11-25 17:25:38,831 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 17:25:38,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 17:25:38,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 17:25:38,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 17:25:38,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:25:39,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:25:39,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-25 17:25:39,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029853053] [2019-11-25 17:25:39,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 17:25:39,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:39,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 17:25:39,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:25:39,061 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 17 states. [2019-11-25 17:25:40,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:40,305 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2019-11-25 17:25:40,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 17:25:40,306 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-11-25 17:25:40,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:40,308 INFO L225 Difference]: With dead ends: 123 [2019-11-25 17:25:40,308 INFO L226 Difference]: Without dead ends: 123 [2019-11-25 17:25:40,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2019-11-25 17:25:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-25 17:25:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 81. [2019-11-25 17:25:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-25 17:25:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-11-25 17:25:40,324 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 36 [2019-11-25 17:25:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:40,325 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-11-25 17:25:40,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 17:25:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-11-25 17:25:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-25 17:25:40,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:40,332 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:40,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:40,537 INFO L410 AbstractCegarLoop]: === Iteration 14 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:40,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1630798574, now seen corresponding path program 1 times [2019-11-25 17:25:40,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:40,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077593330] [2019-11-25 17:25:40,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-25 17:25:40,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077593330] [2019-11-25 17:25:40,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817806251] [2019-11-25 17:25:40,658 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-25 17:25:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:40,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 17:25:40,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-25 17:25:40,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:25:40,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2019-11-25 17:25:40,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947051511] [2019-11-25 17:25:40,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:25:40,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:40,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:25:40,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:25:40,792 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 6 states. [2019-11-25 17:25:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:40,876 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-11-25 17:25:40,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:25:40,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-25 17:25:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:40,878 INFO L225 Difference]: With dead ends: 104 [2019-11-25 17:25:40,878 INFO L226 Difference]: Without dead ends: 101 [2019-11-25 17:25:40,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:25:40,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-25 17:25:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2019-11-25 17:25:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-25 17:25:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-11-25 17:25:40,886 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 58 [2019-11-25 17:25:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:40,886 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-11-25 17:25:40,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:25:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-11-25 17:25:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-25 17:25:40,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:40,887 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:41,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:41,089 INFO L410 AbstractCegarLoop]: === Iteration 15 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:41,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:41,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1652012609, now seen corresponding path program 1 times [2019-11-25 17:25:41,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:41,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479121314] [2019-11-25 17:25:41,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 17:25:41,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479121314] [2019-11-25 17:25:41,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207073631] [2019-11-25 17:25:41,213 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-25 17:25:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 17:25:41,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 17:25:41,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:25:41,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 9 [2019-11-25 17:25:41,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651149442] [2019-11-25 17:25:41,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:25:41,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:41,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:25:41,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:25:41,294 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 7 states. [2019-11-25 17:25:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:41,347 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-11-25 17:25:41,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:25:41,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-11-25 17:25:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:41,349 INFO L225 Difference]: With dead ends: 86 [2019-11-25 17:25:41,349 INFO L226 Difference]: Without dead ends: 76 [2019-11-25 17:25:41,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:25:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-25 17:25:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-25 17:25:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-25 17:25:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-11-25 17:25:41,353 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 61 [2019-11-25 17:25:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:41,353 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-11-25 17:25:41,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:25:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-11-25 17:25:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-25 17:25:41,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:41,355 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:41,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:41,562 INFO L410 AbstractCegarLoop]: === Iteration 16 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:41,563 INFO L82 PathProgramCache]: Analyzing trace with hash -35663204, now seen corresponding path program 1 times [2019-11-25 17:25:41,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:41,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805866730] [2019-11-25 17:25:41,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-25 17:25:41,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805866730] [2019-11-25 17:25:41,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:41,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 17:25:41,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771585798] [2019-11-25 17:25:41,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 17:25:41,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:41,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 17:25:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:25:41,762 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 12 states. [2019-11-25 17:25:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:42,302 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-25 17:25:42,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 17:25:42,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-11-25 17:25:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:42,304 INFO L225 Difference]: With dead ends: 76 [2019-11-25 17:25:42,305 INFO L226 Difference]: Without dead ends: 76 [2019-11-25 17:25:42,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-11-25 17:25:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-25 17:25:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-25 17:25:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-25 17:25:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-11-25 17:25:42,309 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 64 [2019-11-25 17:25:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:42,311 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-25 17:25:42,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 17:25:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-11-25 17:25:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 17:25:42,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:42,313 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:42,313 INFO L410 AbstractCegarLoop]: === Iteration 17 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:42,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1633609241, now seen corresponding path program 1 times [2019-11-25 17:25:42,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:42,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910797036] [2019-11-25 17:25:42,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-25 17:25:42,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910797036] [2019-11-25 17:25:42,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621843571] [2019-11-25 17:25:42,560 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-25 17:25:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:42,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 17:25:42,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 17:25:42,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:25:42,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 16 [2019-11-25 17:25:42,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866238736] [2019-11-25 17:25:42,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:25:42,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:42,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:25:42,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-11-25 17:25:42,673 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2019-11-25 17:25:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:42,716 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-25 17:25:42,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:25:42,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-25 17:25:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:42,718 INFO L225 Difference]: With dead ends: 76 [2019-11-25 17:25:42,718 INFO L226 Difference]: Without dead ends: 75 [2019-11-25 17:25:42,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:25:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-25 17:25:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-25 17:25:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-25 17:25:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-11-25 17:25:42,723 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 66 [2019-11-25 17:25:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:42,723 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-11-25 17:25:42,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:25:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-11-25 17:25:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-25 17:25:42,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:42,725 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:42,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:42,929 INFO L410 AbstractCegarLoop]: === Iteration 18 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:42,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:42,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1616930628, now seen corresponding path program 1 times [2019-11-25 17:25:42,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:42,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405817729] [2019-11-25 17:25:42,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-25 17:25:43,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405817729] [2019-11-25 17:25:43,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943054184] [2019-11-25 17:25:43,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:43,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-25 17:25:43,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:43,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 17:25:43,623 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:43,628 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:43,628 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:25:43,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-25 17:25:43,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-25 17:25:43,807 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:43,815 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:43,816 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:25:43,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-25 17:25:43,874 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:43,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-11-25 17:25:43,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:43,878 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:43,905 INFO L588 ElimStorePlain]: treesize reduction 16, result has 68.6 percent of original size [2019-11-25 17:25:43,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:43,907 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:43,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:36 [2019-11-25 17:25:43,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:43,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:43,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:44,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:44,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:25:44,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2019-11-25 17:25:44,830 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:44,838 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:44,839 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:25:44,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-11-25 17:25:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-25 17:25:44,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:25:44,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [21] total 36 [2019-11-25 17:25:44,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169157154] [2019-11-25 17:25:44,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 17:25:44,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:44,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 17:25:44,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2019-11-25 17:25:44,925 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 17 states. [2019-11-25 17:25:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:47,930 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-25 17:25:47,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-25 17:25:47,931 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-11-25 17:25:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:47,932 INFO L225 Difference]: With dead ends: 78 [2019-11-25 17:25:47,932 INFO L226 Difference]: Without dead ends: 78 [2019-11-25 17:25:47,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=236, Invalid=2116, Unknown=0, NotChecked=0, Total=2352 [2019-11-25 17:25:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-25 17:25:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-25 17:25:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-25 17:25:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-11-25 17:25:47,937 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 68 [2019-11-25 17:25:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:47,938 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-11-25 17:25:47,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 17:25:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-11-25 17:25:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-25 17:25:47,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:47,940 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:48,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:48,143 INFO L410 AbstractCegarLoop]: === Iteration 19 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:48,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash 907828895, now seen corresponding path program 1 times [2019-11-25 17:25:48,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:48,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254885161] [2019-11-25 17:25:48,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-25 17:25:48,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254885161] [2019-11-25 17:25:48,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:25:48,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 17:25:48,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784539530] [2019-11-25 17:25:48,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 17:25:48,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:48,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 17:25:48,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:25:48,388 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 13 states. [2019-11-25 17:25:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:49,266 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2019-11-25 17:25:49,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 17:25:49,266 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-11-25 17:25:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:49,268 INFO L225 Difference]: With dead ends: 126 [2019-11-25 17:25:49,268 INFO L226 Difference]: Without dead ends: 126 [2019-11-25 17:25:49,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-11-25 17:25:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-25 17:25:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2019-11-25 17:25:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-25 17:25:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-11-25 17:25:49,274 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 70 [2019-11-25 17:25:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:49,274 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-11-25 17:25:49,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 17:25:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-11-25 17:25:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-25 17:25:49,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:49,276 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:49,277 INFO L410 AbstractCegarLoop]: === Iteration 20 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:49,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1554600484, now seen corresponding path program 1 times [2019-11-25 17:25:49,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:49,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490889343] [2019-11-25 17:25:49,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-25 17:25:49,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490889343] [2019-11-25 17:25:49,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581809835] [2019-11-25 17:25:49,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:49,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 17:25:49,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:49,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-25 17:25:49,899 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:49,901 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:49,902 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:49,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-25 17:25:49,960 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-25 17:25:49,960 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:49,961 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:49,962 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:49,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-25 17:25:50,081 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-25 17:25:50,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-25 17:25:50,083 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:50,095 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:50,096 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:50,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-25 17:25:50,240 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-25 17:25:50,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-25 17:25:50,241 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:50,251 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:50,252 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:50,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-25 17:25:50,377 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-25 17:25:50,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-25 17:25:50,379 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:50,393 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:50,394 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:50,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-25 17:25:50,513 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-25 17:25:50,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-25 17:25:50,514 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:50,524 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:50,525 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:50,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-25 17:25:50,646 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-25 17:25:50,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-25 17:25:50,647 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:50,659 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:50,659 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:50,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-25 17:25:50,781 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-25 17:25:50,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-25 17:25:50,783 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:50,793 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:50,794 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:50,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-25 17:25:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-25 17:25:50,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 17:25:50,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-11-25 17:25:50,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930418319] [2019-11-25 17:25:50,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 17:25:50,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:50,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 17:25:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-11-25 17:25:50,981 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 9 states. [2019-11-25 17:25:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:25:51,495 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-25 17:25:51,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:25:51,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-11-25 17:25:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:25:51,497 INFO L225 Difference]: With dead ends: 118 [2019-11-25 17:25:51,498 INFO L226 Difference]: Without dead ends: 83 [2019-11-25 17:25:51,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 15 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-11-25 17:25:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-25 17:25:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-25 17:25:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-25 17:25:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-11-25 17:25:51,503 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 80 [2019-11-25 17:25:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:25:51,504 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-11-25 17:25:51,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 17:25:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-11-25 17:25:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 17:25:51,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:25:51,505 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:25:51,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:51,709 INFO L410 AbstractCegarLoop]: === Iteration 21 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-25 17:25:51,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:25:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1047974994, now seen corresponding path program 1 times [2019-11-25 17:25:51,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 17:25:51,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108872553] [2019-11-25 17:25:51,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 17:25:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-25 17:25:52,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108872553] [2019-11-25 17:25:52,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563476903] [2019-11-25 17:25:52,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:25:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:25:52,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-25 17:25:52,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:25:52,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-25 17:25:52,541 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:52,549 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:52,550 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:52,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-11-25 17:25:53,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-25 17:25:53,211 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:25:53,225 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:25:53,226 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:25:53,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-11-25 17:25:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-25 17:25:53,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:25:53,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2019-11-25 17:25:53,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114205897] [2019-11-25 17:25:53,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-25 17:25:53,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 17:25:53,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-25 17:25:53,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2019-11-25 17:25:53,334 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 31 states. [2019-11-25 17:25:59,873 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-25 17:26:02,712 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-11-25 17:26:02,956 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-25 17:26:04,263 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-11-25 17:26:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:26:05,257 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2019-11-25 17:26:05,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-25 17:26:05,257 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 83 [2019-11-25 17:26:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:26:05,258 INFO L225 Difference]: With dead ends: 117 [2019-11-25 17:26:05,258 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 17:26:05,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=458, Invalid=3448, Unknown=0, NotChecked=0, Total=3906 [2019-11-25 17:26:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 17:26:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 17:26:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 17:26:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 17:26:05,260 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-11-25 17:26:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:26:05,261 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 17:26:05,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-25 17:26:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 17:26:05,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 17:26:05,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 17:26:05,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:26:05 BoogieIcfgContainer [2019-11-25 17:26:05,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:26:05,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:26:05,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:26:05,472 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:26:05,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:25:29" (3/4) ... [2019-11-25 17:26:05,477 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 17:26:05,485 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 17:26:05,485 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mkdup [2019-11-25 17:26:05,485 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure finddup [2019-11-25 17:26:05,486 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 17:26:05,486 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-25 17:26:05,486 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 17:26:05,494 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-11-25 17:26:05,494 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-25 17:26:05,495 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 17:26:05,495 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:26:05,557 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 17:26:05,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:26:05,559 INFO L168 Benchmark]: Toolchain (without parser) took 37037.25 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.6 MB). Free memory was 957.7 MB in the beginning and 893.8 MB in the end (delta: 63.8 MB). Peak memory consumption was 454.4 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:05,559 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:26:05,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -122.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:05,560 INFO L168 Benchmark]: Boogie Preprocessor took 91.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:05,560 INFO L168 Benchmark]: RCFGBuilder took 671.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:05,560 INFO L168 Benchmark]: TraceAbstraction took 35846.62 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 306.2 MB). Free memory was 1.0 GB in the beginning and 894.6 MB in the end (delta: 140.2 MB). Peak memory consumption was 446.4 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:05,560 INFO L168 Benchmark]: Witness Printer took 85.89 ms. Allocated memory is still 1.4 GB. Free memory was 894.6 MB in the beginning and 893.8 MB in the end (delta: 749.0 kB). Peak memory consumption was 749.0 kB. Max. memory is 11.5 GB. [2019-11-25 17:26:05,562 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -122.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 671.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35846.62 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 306.2 MB). Free memory was 1.0 GB in the beginning and 894.6 MB in the end (delta: 140.2 MB). Peak memory consumption was 446.4 MB. Max. memory is 11.5 GB. * Witness Printer took 85.89 ms. Allocated memory is still 1.4 GB. Free memory was 894.6 MB in the beginning and 893.8 MB in the end (delta: 749.0 kB). Peak memory consumption was 749.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 106 locations, 36 error locations. Result: SAFE, OverallTime: 35.7s, OverallIterations: 21, TraceHistogramMax: 5, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1220 SDtfs, 2611 SDslu, 3582 SDs, 0 SdLazy, 7640 SolverSat, 799 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1030 GetRequests, 616 SyntacticMatches, 33 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 155 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1341 ConstructedInterpolants, 134 QuantifiedInterpolants, 833189 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2156 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 341/444 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...