./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7c71bc25 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-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c261d11d6e37ef6eda45455c8074b5a0eac3352b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-7c71bc2 [2019-11-25 14:05:13,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 14:05:13,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 14:05:13,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 14:05:13,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 14:05:13,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 14:05:13,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 14:05:13,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 14:05:13,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 14:05:13,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 14:05:13,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 14:05:13,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 14:05:13,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 14:05:13,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 14:05:13,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 14:05:13,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 14:05:13,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 14:05:13,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 14:05:13,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 14:05:13,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 14:05:13,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 14:05:13,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 14:05:13,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 14:05:13,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 14:05:13,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 14:05:13,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 14:05:13,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 14:05:13,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 14:05:13,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 14:05:13,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 14:05:13,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 14:05:13,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 14:05:13,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 14:05:13,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 14:05:13,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 14:05:13,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 14:05:13,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 14:05:13,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 14:05:13,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 14:05:13,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 14:05:13,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 14:05:13,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 14:05:13,272 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 14:05:13,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 14:05:13,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 14:05:13,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 14:05:13,276 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 14:05:13,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 14:05:13,276 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 14:05:13,276 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 14:05:13,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 14:05:13,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 14:05:13,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 14:05:13,278 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 14:05:13,279 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 14:05:13,279 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 14:05:13,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 14:05:13,280 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 14:05:13,280 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 14:05:13,280 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 14:05:13,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 14:05:13,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 14:05:13,281 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 14:05:13,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 14:05:13,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 14:05:13,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 14:05:13,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 14:05:13,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 14:05:13,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 14:05:13,283 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-11-25 14:05:13,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 14:05:13,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 14:05:13,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 14:05:13,633 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 14:05:13,633 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 14:05:13,634 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 14:05:13,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e746397a8/758a295476014484ad6e05c46e6210f4/FLAG4212ba5bb [2019-11-25 14:05:14,178 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 14:05:14,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-11-25 14:05:14,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e746397a8/758a295476014484ad6e05c46e6210f4/FLAG4212ba5bb [2019-11-25 14:05:14,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e746397a8/758a295476014484ad6e05c46e6210f4 [2019-11-25 14:05:14,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 14:05:14,554 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 14:05:14,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 14:05:14,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 14:05:14,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 14:05:14,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:05:14" (1/1) ... [2019-11-25 14:05:14,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c44cb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:05:14, skipping insertion in model container [2019-11-25 14:05:14,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:05:14" (1/1) ... [2019-11-25 14:05:14,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 14:05:14,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 14:05:14,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 14:05:14,792 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 14:05:14,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 14:05:14,893 INFO L208 MainTranslator]: Completed translation [2019-11-25 14:05:14,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:05:14 WrapperNode [2019-11-25 14:05:14,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 14:05:14,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 14:05:14,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 14:05:14,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 14:05:14,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:05:14" (1/1) ... [2019-11-25 14:05:14,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:05:14" (1/1) ... [2019-11-25 14:05:14,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:05:14" (1/1) ... [2019-11-25 14:05:14,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:05:14" (1/1) ... [2019-11-25 14:05:14,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:05:14" (1/1) ... [2019-11-25 14:05:14,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:05:14" (1/1) ... [2019-11-25 14:05:14,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:05:14" (1/1) ... [2019-11-25 14:05:14,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 14:05:14,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 14:05:14,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 14:05:14,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 14:05:14,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:05:14" (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 14:05:15,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 14:05:15,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 14:05:15,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-25 14:05:15,009 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-11-25 14:05:15,010 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-11-25 14:05:15,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 14:05:15,012 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 14:05:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 14:05:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 14:05:15,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 14:05:15,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-25 14:05:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 14:05:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-25 14:05:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-11-25 14:05:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 14:05:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-11-25 14:05:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 14:05:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 14:05:15,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 14:05:15,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 14:05:15,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 14:05:15,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 14:05:15,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 14:05:15,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 14:05:15,587 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 14:05:15,587 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-25 14:05:15,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:05:15 BoogieIcfgContainer [2019-11-25 14:05:15,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 14:05:15,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 14:05:15,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 14:05:15,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 14:05:15,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 02:05:14" (1/3) ... [2019-11-25 14:05:15,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4985db91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 02:05:15, skipping insertion in model container [2019-11-25 14:05:15,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:05:14" (2/3) ... [2019-11-25 14:05:15,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4985db91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 02:05:15, skipping insertion in model container [2019-11-25 14:05:15,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:05:15" (3/3) ... [2019-11-25 14:05:15,597 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-25 14:05:15,607 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 14:05:15,615 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2019-11-25 14:05:15,627 INFO L249 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2019-11-25 14:05:15,649 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 14:05:15,650 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 14:05:15,650 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 14:05:15,650 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 14:05:15,650 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 14:05:15,651 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 14:05:15,651 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 14:05:15,651 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 14:05:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-11-25 14:05:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 14:05:15,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:15,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:05:15,685 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 14:05:15,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash -115732399, now seen corresponding path program 1 times [2019-11-25 14:05:15,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:15,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073980522] [2019-11-25 14:05:15,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:16,047 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 14:05:16,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073980522] [2019-11-25 14:05:16,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:05:16,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 14:05:16,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034102025] [2019-11-25 14:05:16,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 14:05:16,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:16,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 14:05:16,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 14:05:16,087 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 8 states. [2019-11-25 14:05:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:16,930 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-11-25 14:05:16,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 14:05:16,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-25 14:05:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:16,946 INFO L225 Difference]: With dead ends: 103 [2019-11-25 14:05:16,947 INFO L226 Difference]: Without dead ends: 100 [2019-11-25 14:05:16,949 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 14:05:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-25 14:05:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-25 14:05:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-25 14:05:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-25 14:05:17,008 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 14 [2019-11-25 14:05:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:17,009 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-25 14:05:17,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 14:05:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-25 14:05:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 14:05:17,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:17,010 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:05:17,011 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 14:05:17,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:17,011 INFO L82 PathProgramCache]: Analyzing trace with hash -115732398, now seen corresponding path program 1 times [2019-11-25 14:05:17,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:17,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955850665] [2019-11-25 14:05:17,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:17,281 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 14:05:17,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955850665] [2019-11-25 14:05:17,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:05:17,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 14:05:17,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817728769] [2019-11-25 14:05:17,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 14:05:17,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:17,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 14:05:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 14:05:17,291 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 8 states. [2019-11-25 14:05:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:17,929 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-25 14:05:17,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 14:05:17,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-25 14:05:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:17,931 INFO L225 Difference]: With dead ends: 99 [2019-11-25 14:05:17,931 INFO L226 Difference]: Without dead ends: 99 [2019-11-25 14:05:17,936 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 14:05:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-25 14:05:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-25 14:05:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-25 14:05:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-11-25 14:05:17,953 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 14 [2019-11-25 14:05:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:17,953 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-11-25 14:05:17,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 14:05:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-11-25 14:05:17,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 14:05:17,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:17,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:05:17,955 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 14:05:17,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:17,955 INFO L82 PathProgramCache]: Analyzing trace with hash 707263019, now seen corresponding path program 1 times [2019-11-25 14:05:17,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:17,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753575769] [2019-11-25 14:05:17,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:18,118 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 14:05:18,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753575769] [2019-11-25 14:05:18,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:05:18,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 14:05:18,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057821880] [2019-11-25 14:05:18,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 14:05:18,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 14:05:18,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 14:05:18,121 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 8 states. [2019-11-25 14:05:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:18,725 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-25 14:05:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 14:05:18,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-25 14:05:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:18,728 INFO L225 Difference]: With dead ends: 98 [2019-11-25 14:05:18,728 INFO L226 Difference]: Without dead ends: 98 [2019-11-25 14:05:18,729 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 14:05:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-25 14:05:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-25 14:05:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-25 14:05:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-25 14:05:18,740 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 15 [2019-11-25 14:05:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:18,741 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-25 14:05:18,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 14:05:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-25 14:05:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 14:05:18,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:18,742 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 14:05:18,743 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 14:05:18,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:18,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745985, now seen corresponding path program 1 times [2019-11-25 14:05:18,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:18,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995107644] [2019-11-25 14:05:18,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:18,876 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 14:05:18,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995107644] [2019-11-25 14:05:18,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:05:18,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 14:05:18,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169206354] [2019-11-25 14:05:18,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 14:05:18,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:18,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 14:05:18,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 14:05:18,879 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 8 states. [2019-11-25 14:05:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:19,412 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-25 14:05:19,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 14:05:19,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-25 14:05:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:19,414 INFO L225 Difference]: With dead ends: 96 [2019-11-25 14:05:19,414 INFO L226 Difference]: Without dead ends: 96 [2019-11-25 14:05:19,415 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 14:05:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-25 14:05:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-25 14:05:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-25 14:05:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-25 14:05:19,424 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 23 [2019-11-25 14:05:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:19,424 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-25 14:05:19,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 14:05:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-25 14:05:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 14:05:19,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:19,426 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 14:05:19,426 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 14:05:19,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:19,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745986, now seen corresponding path program 1 times [2019-11-25 14:05:19,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:19,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000832305] [2019-11-25 14:05:19,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:19,652 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 14:05:19,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000832305] [2019-11-25 14:05:19,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:05:19,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 14:05:19,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394021443] [2019-11-25 14:05:19,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 14:05:19,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:19,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 14:05:19,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-25 14:05:19,655 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 11 states. [2019-11-25 14:05:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:20,758 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2019-11-25 14:05:20,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 14:05:20,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-25 14:05:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:20,761 INFO L225 Difference]: With dead ends: 116 [2019-11-25 14:05:20,761 INFO L226 Difference]: Without dead ends: 116 [2019-11-25 14:05:20,762 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 14:05:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-25 14:05:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2019-11-25 14:05:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-25 14:05:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-11-25 14:05:20,771 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 23 [2019-11-25 14:05:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:20,772 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-11-25 14:05:20,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 14:05:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-11-25 14:05:20,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 14:05:20,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:20,773 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 14:05:20,773 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 14:05:20,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:20,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1149583382, now seen corresponding path program 1 times [2019-11-25 14:05:20,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:20,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121791589] [2019-11-25 14:05:20,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:21,020 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 14:05:21,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121791589] [2019-11-25 14:05:21,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:05:21,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-25 14:05:21,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132142363] [2019-11-25 14:05:21,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 14:05:21,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:21,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 14:05:21,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-25 14:05:21,023 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 12 states. [2019-11-25 14:05:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:22,001 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2019-11-25 14:05:22,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 14:05:22,002 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-11-25 14:05:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:22,003 INFO L225 Difference]: With dead ends: 99 [2019-11-25 14:05:22,003 INFO L226 Difference]: Without dead ends: 99 [2019-11-25 14:05:22,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-11-25 14:05:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-25 14:05:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-25 14:05:22,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-25 14:05:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-11-25 14:05:22,014 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 24 [2019-11-25 14:05:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:22,015 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-11-25 14:05:22,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 14:05:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-11-25 14:05:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 14:05:22,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:22,016 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 14:05:22,017 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 14:05:22,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:22,017 INFO L82 PathProgramCache]: Analyzing trace with hash 943033910, now seen corresponding path program 1 times [2019-11-25 14:05:22,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:22,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472602111] [2019-11-25 14:05:22,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:22,100 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 14:05:22,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472602111] [2019-11-25 14:05:22,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:05:22,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 14:05:22,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97727383] [2019-11-25 14:05:22,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 14:05:22,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:22,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 14:05:22,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 14:05:22,103 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2019-11-25 14:05:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:22,493 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-11-25 14:05:22,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 14:05:22,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-25 14:05:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:22,495 INFO L225 Difference]: With dead ends: 94 [2019-11-25 14:05:22,495 INFO L226 Difference]: Without dead ends: 94 [2019-11-25 14:05:22,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-25 14:05:22,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-25 14:05:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-11-25 14:05:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-25 14:05:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-11-25 14:05:22,506 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 26 [2019-11-25 14:05:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:22,506 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-11-25 14:05:22,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 14:05:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-11-25 14:05:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 14:05:22,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:22,508 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 14:05:22,508 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 14:05:22,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:22,508 INFO L82 PathProgramCache]: Analyzing trace with hash 943033911, now seen corresponding path program 1 times [2019-11-25 14:05:22,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:22,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034813037] [2019-11-25 14:05:22,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:22,634 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 14:05:22,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034813037] [2019-11-25 14:05:22,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:05:22,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 14:05:22,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336803] [2019-11-25 14:05:22,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 14:05:22,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:22,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 14:05:22,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 14:05:22,637 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 7 states. [2019-11-25 14:05:23,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:23,023 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-11-25 14:05:23,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 14:05:23,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-25 14:05:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:23,025 INFO L225 Difference]: With dead ends: 89 [2019-11-25 14:05:23,025 INFO L226 Difference]: Without dead ends: 89 [2019-11-25 14:05:23,026 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 14:05:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-25 14:05:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-11-25 14:05:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-25 14:05:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-11-25 14:05:23,031 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 26 [2019-11-25 14:05:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:23,032 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-11-25 14:05:23,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 14:05:23,032 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-11-25 14:05:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 14:05:23,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:23,033 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 14:05:23,033 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 14:05:23,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:23,034 INFO L82 PathProgramCache]: Analyzing trace with hash 941830451, now seen corresponding path program 1 times [2019-11-25 14:05:23,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:23,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904719590] [2019-11-25 14:05:23,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:23,134 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 14:05:23,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904719590] [2019-11-25 14:05:23,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76208963] [2019-11-25 14:05:23,135 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 14:05:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:23,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 14:05:23,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:05:23,229 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 14:05:23,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 14:05:23,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2019-11-25 14:05:23,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527658342] [2019-11-25 14:05:23,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 14:05:23,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 14:05:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 14:05:23,231 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 5 states. [2019-11-25 14:05:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:23,309 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-11-25 14:05:23,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 14:05:23,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-25 14:05:23,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:23,314 INFO L225 Difference]: With dead ends: 112 [2019-11-25 14:05:23,314 INFO L226 Difference]: Without dead ends: 112 [2019-11-25 14:05:23,315 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 14:05:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-25 14:05:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2019-11-25 14:05:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-25 14:05:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-11-25 14:05:23,330 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 26 [2019-11-25 14:05:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:23,331 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-11-25 14:05:23,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 14:05:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-11-25 14:05:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 14:05:23,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:23,332 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 14:05:23,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:05:23,534 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 14:05:23,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash -830719863, now seen corresponding path program 1 times [2019-11-25 14:05:23,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:23,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064811451] [2019-11-25 14:05:23,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:23,621 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 14:05:23,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064811451] [2019-11-25 14:05:23,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:05:23,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 14:05:23,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331157333] [2019-11-25 14:05:23,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 14:05:23,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:23,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 14:05:23,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 14:05:23,624 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 7 states. [2019-11-25 14:05:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:23,964 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-11-25 14:05:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 14:05:23,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-25 14:05:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:23,969 INFO L225 Difference]: With dead ends: 88 [2019-11-25 14:05:23,969 INFO L226 Difference]: Without dead ends: 88 [2019-11-25 14:05:23,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-25 14:05:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-25 14:05:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-25 14:05:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-25 14:05:23,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-11-25 14:05:23,981 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 27 [2019-11-25 14:05:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:23,983 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-11-25 14:05:23,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 14:05:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-11-25 14:05:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 14:05:23,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:23,986 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 14:05:23,987 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 14:05:23,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash -830719862, now seen corresponding path program 1 times [2019-11-25 14:05:23,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:23,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416904985] [2019-11-25 14:05:23,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:24,096 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 14:05:24,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416904985] [2019-11-25 14:05:24,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:05:24,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 14:05:24,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297883535] [2019-11-25 14:05:24,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 14:05:24,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:24,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 14:05:24,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 14:05:24,101 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 7 states. [2019-11-25 14:05:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:24,431 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-11-25 14:05:24,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 14:05:24,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-25 14:05:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:24,433 INFO L225 Difference]: With dead ends: 83 [2019-11-25 14:05:24,433 INFO L226 Difference]: Without dead ends: 83 [2019-11-25 14:05:24,433 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 14:05:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-25 14:05:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-25 14:05:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-25 14:05:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-11-25 14:05:24,440 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 27 [2019-11-25 14:05:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:24,440 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-11-25 14:05:24,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 14:05:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-11-25 14:05:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 14:05:24,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:24,443 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 14:05:24,444 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 14:05:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:24,444 INFO L82 PathProgramCache]: Analyzing trace with hash 48801308, now seen corresponding path program 1 times [2019-11-25 14:05:24,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:24,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86292534] [2019-11-25 14:05:24,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:24,542 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 14:05:24,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86292534] [2019-11-25 14:05:24,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511864486] [2019-11-25 14:05:24,544 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 14:05:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:24,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 14:05:24,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:05:24,635 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 14:05:24,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 14:05:24,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-11-25 14:05:24,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142499132] [2019-11-25 14:05:24,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 14:05:24,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:24,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 14:05:24,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-25 14:05:24,640 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 9 states. [2019-11-25 14:05:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:25,093 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-11-25 14:05:25,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 14:05:25,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-25 14:05:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:25,095 INFO L225 Difference]: With dead ends: 122 [2019-11-25 14:05:25,095 INFO L226 Difference]: Without dead ends: 122 [2019-11-25 14:05:25,095 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 14:05:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-25 14:05:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2019-11-25 14:05:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-25 14:05:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-11-25 14:05:25,111 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 31 [2019-11-25 14:05:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:25,112 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-11-25 14:05:25,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 14:05:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-11-25 14:05:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 14:05:25,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:25,118 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 14:05:25,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:05:25,328 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 14:05:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1425745197, now seen corresponding path program 2 times [2019-11-25 14:05:25,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:25,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289328114] [2019-11-25 14:05:25,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:25,449 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 14:05:25,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289328114] [2019-11-25 14:05:25,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893424183] [2019-11-25 14:05:25,449 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 14:05:25,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 14:05:25,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 14:05:25,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 14:05:25,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:05:25,688 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 14:05:25,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 14:05:25,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-25 14:05:25,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174500848] [2019-11-25 14:05:25,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 14:05:25,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:25,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 14:05:25,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-25 14:05:25,691 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 17 states. [2019-11-25 14:05:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:27,098 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2019-11-25 14:05:27,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 14:05:27,098 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-11-25 14:05:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:27,100 INFO L225 Difference]: With dead ends: 123 [2019-11-25 14:05:27,100 INFO L226 Difference]: Without dead ends: 123 [2019-11-25 14:05:27,104 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 14:05:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-25 14:05:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 81. [2019-11-25 14:05:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-25 14:05:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-11-25 14:05:27,115 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 36 [2019-11-25 14:05:27,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:27,116 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-11-25 14:05:27,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 14:05:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-11-25 14:05:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-25 14:05:27,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:27,123 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 14:05:27,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:05:27,336 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 14:05:27,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:27,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1630798574, now seen corresponding path program 1 times [2019-11-25 14:05:27,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:27,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179084720] [2019-11-25 14:05:27,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:27,462 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 14:05:27,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179084720] [2019-11-25 14:05:27,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614322172] [2019-11-25 14:05:27,463 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 14:05:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:27,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 14:05:27,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:05:27,655 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 14:05:27,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 14:05:27,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2019-11-25 14:05:27,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821077630] [2019-11-25 14:05:27,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 14:05:27,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:27,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 14:05:27,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-25 14:05:27,659 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 6 states. [2019-11-25 14:05:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:27,741 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-11-25 14:05:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 14:05:27,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-25 14:05:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:27,747 INFO L225 Difference]: With dead ends: 104 [2019-11-25 14:05:27,747 INFO L226 Difference]: Without dead ends: 101 [2019-11-25 14:05:27,747 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 14:05:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-25 14:05:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2019-11-25 14:05:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-25 14:05:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-11-25 14:05:27,752 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 58 [2019-11-25 14:05:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:27,752 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-11-25 14:05:27,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 14:05:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-11-25 14:05:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-25 14:05:27,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:27,755 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 14:05:27,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:05:27,960 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 14:05:27,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:27,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1652012609, now seen corresponding path program 1 times [2019-11-25 14:05:27,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:27,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817839841] [2019-11-25 14:05:27,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,070 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 14:05:28,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817839841] [2019-11-25 14:05:28,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926167224] [2019-11-25 14:05:28,071 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 14:05:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 14:05:28,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:05:28,188 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 14:05:28,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 14:05:28,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 9 [2019-11-25 14:05:28,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249395606] [2019-11-25 14:05:28,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 14:05:28,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:28,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 14:05:28,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-25 14:05:28,192 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 7 states. [2019-11-25 14:05:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:28,248 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-11-25 14:05:28,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 14:05:28,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-11-25 14:05:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:28,250 INFO L225 Difference]: With dead ends: 86 [2019-11-25 14:05:28,250 INFO L226 Difference]: Without dead ends: 76 [2019-11-25 14:05:28,251 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 14:05:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-25 14:05:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-25 14:05:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-25 14:05:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-11-25 14:05:28,255 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 61 [2019-11-25 14:05:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:28,255 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-11-25 14:05:28,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 14:05:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-11-25 14:05:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-25 14:05:28,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:28,256 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 14:05:28,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:05:28,460 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 14:05:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash -35663204, now seen corresponding path program 1 times [2019-11-25 14:05:28,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:28,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930611975] [2019-11-25 14:05:28,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:28,646 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 14:05:28,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930611975] [2019-11-25 14:05:28,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:05:28,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 14:05:28,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015652507] [2019-11-25 14:05:28,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 14:05:28,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:28,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 14:05:28,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-25 14:05:28,653 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 12 states. [2019-11-25 14:05:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:29,308 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-25 14:05:29,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 14:05:29,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-11-25 14:05:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:29,310 INFO L225 Difference]: With dead ends: 76 [2019-11-25 14:05:29,310 INFO L226 Difference]: Without dead ends: 76 [2019-11-25 14:05:29,311 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 14:05:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-25 14:05:29,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-25 14:05:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-25 14:05:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-11-25 14:05:29,320 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 64 [2019-11-25 14:05:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:29,324 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-25 14:05:29,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 14:05:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-11-25 14:05:29,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 14:05:29,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:29,326 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 14:05:29,327 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 14:05:29,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:29,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1633609241, now seen corresponding path program 1 times [2019-11-25 14:05:29,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:29,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710040828] [2019-11-25 14:05:29,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:29,699 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 14:05:29,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710040828] [2019-11-25 14:05:29,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750617205] [2019-11-25 14:05:29,700 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 14:05:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:29,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 14:05:29,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:05:29,855 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 14:05:29,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 14:05:29,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 16 [2019-11-25 14:05:29,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978237320] [2019-11-25 14:05:29,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 14:05:29,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:29,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 14:05:29,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-11-25 14:05:29,858 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2019-11-25 14:05:29,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:29,925 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-25 14:05:29,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 14:05:29,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-25 14:05:29,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:29,927 INFO L225 Difference]: With dead ends: 76 [2019-11-25 14:05:29,927 INFO L226 Difference]: Without dead ends: 75 [2019-11-25 14:05:29,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-11-25 14:05:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-25 14:05:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-25 14:05:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-25 14:05:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-11-25 14:05:29,935 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 66 [2019-11-25 14:05:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:29,936 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-11-25 14:05:29,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 14:05:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-11-25 14:05:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-25 14:05:29,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:29,938 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 14:05:30,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:05:30,144 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 14:05:30,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:30,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1616930628, now seen corresponding path program 1 times [2019-11-25 14:05:30,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:30,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25633268] [2019-11-25 14:05:30,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:30,697 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 14:05:30,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25633268] [2019-11-25 14:05:30,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9637562] [2019-11-25 14:05:30,699 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 14:05:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:30,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-25 14:05:30,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:05:30,866 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 14:05:30,866 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:30,874 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:30,874 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 14:05:30,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-25 14:05:31,086 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 14:05:31,086 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:31,095 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:31,096 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 14:05:31,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-25 14:05:31,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:31,168 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 14:05:31,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:31,173 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:31,212 INFO L588 ElimStorePlain]: treesize reduction 16, result has 68.6 percent of original size [2019-11-25 14:05:31,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:31,215 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 14:05:31,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:36 [2019-11-25 14:05:31,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:31,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:31,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:31,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:31,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 14:05:32,270 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 14:05:32,271 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:32,278 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:32,278 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 14:05:32,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-11-25 14:05:32,357 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 14:05:32,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 14:05:32,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [21] total 36 [2019-11-25 14:05:32,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322846722] [2019-11-25 14:05:32,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 14:05:32,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:32,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 14:05:32,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2019-11-25 14:05:32,361 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 17 states. [2019-11-25 14:05:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:35,437 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-25 14:05:35,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-25 14:05:35,437 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-11-25 14:05:35,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:35,439 INFO L225 Difference]: With dead ends: 78 [2019-11-25 14:05:35,439 INFO L226 Difference]: Without dead ends: 78 [2019-11-25 14:05:35,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=236, Invalid=2116, Unknown=0, NotChecked=0, Total=2352 [2019-11-25 14:05:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-25 14:05:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-25 14:05:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-25 14:05:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-11-25 14:05:35,444 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 68 [2019-11-25 14:05:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:35,445 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-11-25 14:05:35,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 14:05:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-11-25 14:05:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-25 14:05:35,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:35,446 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 14:05:35,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:05:35,649 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 14:05:35,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:35,650 INFO L82 PathProgramCache]: Analyzing trace with hash 907828895, now seen corresponding path program 1 times [2019-11-25 14:05:35,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:35,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635107298] [2019-11-25 14:05:35,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:35,919 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 14:05:35,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635107298] [2019-11-25 14:05:35,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:05:35,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 14:05:35,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939998018] [2019-11-25 14:05:35,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 14:05:35,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:35,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 14:05:35,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-25 14:05:35,922 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 13 states. [2019-11-25 14:05:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:36,983 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2019-11-25 14:05:36,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 14:05:36,983 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-11-25 14:05:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:36,985 INFO L225 Difference]: With dead ends: 126 [2019-11-25 14:05:36,985 INFO L226 Difference]: Without dead ends: 126 [2019-11-25 14:05:36,985 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 14:05:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-25 14:05:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2019-11-25 14:05:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-25 14:05:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-11-25 14:05:36,993 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 70 [2019-11-25 14:05:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:36,994 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-11-25 14:05:36,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 14:05:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-11-25 14:05:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-25 14:05:36,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:36,995 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 14:05:36,995 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 14:05:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1554600484, now seen corresponding path program 1 times [2019-11-25 14:05:36,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:36,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069170616] [2019-11-25 14:05:36,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:37,631 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 14:05:37,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069170616] [2019-11-25 14:05:37,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720935583] [2019-11-25 14:05:37,632 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 14:05:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:37,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 14:05:37,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:05:37,758 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 14:05:37,759 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:37,760 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:37,761 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 14:05:37,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-25 14:05:37,827 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 14:05:37,828 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:37,830 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:37,831 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 14:05:37,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-25 14:05:37,965 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-25 14:05:37,965 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 14:05:37,966 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:37,976 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:37,977 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 14:05:37,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-25 14:05:38,133 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-25 14:05:38,134 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 14:05:38,135 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:38,151 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:38,152 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 14:05:38,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-25 14:05:38,283 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-25 14:05:38,284 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 14:05:38,285 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:38,296 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:38,297 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 14:05:38,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-25 14:05:38,432 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-25 14:05:38,432 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 14:05:38,433 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:38,444 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:38,445 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 14:05:38,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-25 14:05:38,589 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-25 14:05:38,589 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 14:05:38,590 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:38,601 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:38,602 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 14:05:38,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-25 14:05:38,714 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-25 14:05:38,715 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 14:05:38,716 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:38,728 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:38,729 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 14:05:38,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-25 14:05:38,880 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 14:05:38,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 14:05:38,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-11-25 14:05:38,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130638153] [2019-11-25 14:05:38,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 14:05:38,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:38,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 14:05:38,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-11-25 14:05:38,882 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 9 states. [2019-11-25 14:05:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:39,420 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-25 14:05:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 14:05:39,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-11-25 14:05:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:39,422 INFO L225 Difference]: With dead ends: 118 [2019-11-25 14:05:39,422 INFO L226 Difference]: Without dead ends: 83 [2019-11-25 14:05:39,423 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 14:05:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-25 14:05:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-25 14:05:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-25 14:05:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-11-25 14:05:39,427 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 80 [2019-11-25 14:05:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:39,427 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-11-25 14:05:39,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 14:05:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-11-25 14:05:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 14:05:39,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:05:39,429 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 14:05:39,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:05:39,632 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 14:05:39,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:05:39,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1047974994, now seen corresponding path program 1 times [2019-11-25 14:05:39,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:05:39,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260066412] [2019-11-25 14:05:39,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:05:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:40,200 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 14:05:40,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260066412] [2019-11-25 14:05:40,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082757203] [2019-11-25 14:05:40,201 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 14:05:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:05:40,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-25 14:05:40,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:05:40,707 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 14:05:40,707 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:40,718 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:40,718 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 14:05:40,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-11-25 14:05:41,518 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 14:05:41,519 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 14:05:41,533 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 14:05:41,534 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 14:05:41,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-11-25 14:05:41,642 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 14:05:41,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 14:05:41,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2019-11-25 14:05:41,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211574168] [2019-11-25 14:05:41,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-25 14:05:41,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:05:41,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-25 14:05:41,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2019-11-25 14:05:41,644 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 31 states. [2019-11-25 14:05:45,935 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-25 14:05:46,978 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-25 14:05:49,955 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-25 14:05:50,585 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-11-25 14:05:51,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:05:51,062 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2019-11-25 14:05:51,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-25 14:05:51,063 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 83 [2019-11-25 14:05:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:05:51,064 INFO L225 Difference]: With dead ends: 117 [2019-11-25 14:05:51,064 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 14:05:51,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=458, Invalid=3448, Unknown=0, NotChecked=0, Total=3906 [2019-11-25 14:05:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 14:05:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 14:05:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 14:05:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 14:05:51,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-11-25 14:05:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:05:51,067 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 14:05:51,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-25 14:05:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 14:05:51,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 14:05:51,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:05:51,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 02:05:51 BoogieIcfgContainer [2019-11-25 14:05:51,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 14:05:51,275 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 14:05:51,275 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 14:05:51,275 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 14:05:51,276 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:05:15" (3/4) ... [2019-11-25 14:05:51,280 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 14:05:51,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 14:05:51,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mkdup [2019-11-25 14:05:51,288 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure finddup [2019-11-25 14:05:51,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 14:05:51,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-25 14:05:51,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 14:05:51,298 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-11-25 14:05:51,298 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-25 14:05:51,299 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 14:05:51,299 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 14:05:51,360 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 14:05:51,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 14:05:51,362 INFO L168 Benchmark]: Toolchain (without parser) took 36809.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 363.3 MB). Free memory was 957.7 MB in the beginning and 882.8 MB in the end (delta: 74.9 MB). Peak memory consumption was 438.3 MB. Max. memory is 11.5 GB. [2019-11-25 14:05:51,363 INFO L168 Benchmark]: CDTParser took 0.30 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 14:05:51,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -115.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 14:05:51,364 INFO L168 Benchmark]: Boogie Preprocessor took 45.95 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-25 14:05:51,364 INFO L168 Benchmark]: RCFGBuilder took 648.17 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: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2019-11-25 14:05:51,364 INFO L168 Benchmark]: TraceAbstraction took 35684.68 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 286.3 MB). Free memory was 1.0 GB in the beginning and 883.5 MB in the end (delta: 142.4 MB). Peak memory consumption was 428.7 MB. Max. memory is 11.5 GB. [2019-11-25 14:05:51,365 INFO L168 Benchmark]: Witness Printer took 85.93 ms. Allocated memory is still 1.4 GB. Free memory was 883.5 MB in the beginning and 882.8 MB in the end (delta: 740.4 kB). Peak memory consumption was 740.4 kB. Max. memory is 11.5 GB. [2019-11-25 14:05:51,367 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.30 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 338.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -115.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.95 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 648.17 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: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35684.68 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 286.3 MB). Free memory was 1.0 GB in the beginning and 883.5 MB in the end (delta: 142.4 MB). Peak memory consumption was 428.7 MB. Max. memory is 11.5 GB. * Witness Printer took 85.93 ms. Allocated memory is still 1.4 GB. Free memory was 883.5 MB in the beginning and 882.8 MB in the end (delta: 740.4 kB). Peak memory consumption was 740.4 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.6s, OverallIterations: 21, TraceHistogramMax: 5, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1220 SDtfs, 2611 SDslu, 3582 SDs, 0 SdLazy, 7643 SolverSat, 799 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1030 GetRequests, 616 SyntacticMatches, 33 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 14.1s 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, 8.6s 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...