./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3d056a1f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/duplets.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c261d11d6e37ef6eda45455c8074b5a0eac3352b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 13:58:36,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 13:58:36,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 13:58:36,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 13:58:36,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 13:58:36,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 13:58:36,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 13:58:36,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 13:58:36,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 13:58:36,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 13:58:36,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 13:58:36,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 13:58:36,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 13:58:36,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 13:58:36,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 13:58:36,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 13:58:36,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 13:58:36,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 13:58:36,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 13:58:36,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 13:58:36,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 13:58:36,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 13:58:36,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 13:58:36,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 13:58:36,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 13:58:36,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 13:58:36,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 13:58:36,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 13:58:36,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 13:58:36,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 13:58:36,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 13:58:36,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 13:58:36,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 13:58:36,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 13:58:36,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 13:58:36,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 13:58:36,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 13:58:36,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 13:58:36,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 13:58:36,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 13:58:36,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 13:58:36,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 13:58:36,918 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 13:58:36,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 13:58:36,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 13:58:36,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 13:58:36,920 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 13:58:36,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 13:58:36,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 13:58:36,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 13:58:36,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 13:58:36,921 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 13:58:36,922 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 13:58:36,922 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 13:58:36,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 13:58:36,923 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 13:58:36,923 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 13:58:36,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 13:58:36,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 13:58:36,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 13:58:36,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 13:58:36,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:58:36,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 13:58:36,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 13:58:36,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 13:58:36,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 13:58:36,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-11-22 13:58:37,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 13:58:37,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 13:58:37,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 13:58:37,269 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 13:58:37,269 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 13:58:37,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2019-11-22 13:58:37,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d43246a0/433a6157c39d4a2bb03df41142eb8f40/FLAGa7cb0aa6b [2019-11-22 13:58:37,797 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 13:58:37,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-11-22 13:58:37,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d43246a0/433a6157c39d4a2bb03df41142eb8f40/FLAGa7cb0aa6b [2019-11-22 13:58:38,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d43246a0/433a6157c39d4a2bb03df41142eb8f40 [2019-11-22 13:58:38,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 13:58:38,171 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 13:58:38,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 13:58:38,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 13:58:38,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 13:58:38,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:58:38" (1/1) ... [2019-11-22 13:58:38,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33339763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:38, skipping insertion in model container [2019-11-22 13:58:38,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:58:38" (1/1) ... [2019-11-22 13:58:38,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 13:58:38,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:58:38,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:58:38,426 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 13:58:38,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:58:38,536 INFO L208 MainTranslator]: Completed translation [2019-11-22 13:58:38,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:38 WrapperNode [2019-11-22 13:58:38,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 13:58:38,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 13:58:38,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 13:58:38,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 13:58:38,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:38" (1/1) ... [2019-11-22 13:58:38,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:38" (1/1) ... [2019-11-22 13:58:38,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:38" (1/1) ... [2019-11-22 13:58:38,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:38" (1/1) ... [2019-11-22 13:58:38,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:38" (1/1) ... [2019-11-22 13:58:38,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:38" (1/1) ... [2019-11-22 13:58:38,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:38" (1/1) ... [2019-11-22 13:58:38,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 13:58:38,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 13:58:38,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 13:58:38,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 13:58:38,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:38" (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-22 13:58:38,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 13:58:38,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 13:58:38,650 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-22 13:58:38,651 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-11-22 13:58:38,651 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-11-22 13:58:38,651 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 13:58:38,652 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-22 13:58:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 13:58:38,653 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 13:58:38,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 13:58:38,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-22 13:58:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 13:58:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-22 13:58:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-11-22 13:58:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 13:58:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-11-22 13:58:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 13:58:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 13:58:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 13:58:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 13:58:38,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-22 13:58:38,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 13:58:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 13:58:38,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 13:58:39,184 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 13:58:39,188 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-22 13:58:39,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:58:39 BoogieIcfgContainer [2019-11-22 13:58:39,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 13:58:39,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 13:58:39,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 13:58:39,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 13:58:39,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:58:38" (1/3) ... [2019-11-22 13:58:39,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdd2ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:58:39, skipping insertion in model container [2019-11-22 13:58:39,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:38" (2/3) ... [2019-11-22 13:58:39,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdd2ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:58:39, skipping insertion in model container [2019-11-22 13:58:39,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:58:39" (3/3) ... [2019-11-22 13:58:39,204 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-22 13:58:39,214 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 13:58:39,223 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2019-11-22 13:58:39,234 INFO L249 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2019-11-22 13:58:39,258 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 13:58:39,258 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 13:58:39,258 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 13:58:39,258 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 13:58:39,259 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 13:58:39,259 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 13:58:39,259 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 13:58:39,259 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 13:58:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-11-22 13:58:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-22 13:58:39,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:39,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:58:39,295 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-22 13:58:39,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:39,300 INFO L82 PathProgramCache]: Analyzing trace with hash -115732399, now seen corresponding path program 1 times [2019-11-22 13:58:39,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:39,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114207458] [2019-11-22 13:58:39,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:39,631 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-22 13:58:39,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114207458] [2019-11-22 13:58:39,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:58:39,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 13:58:39,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337430894] [2019-11-22 13:58:39,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:58:39,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:39,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:58:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:58:39,671 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 8 states. [2019-11-22 13:58:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:40,561 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-11-22 13:58:40,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:58:40,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-22 13:58:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:40,575 INFO L225 Difference]: With dead ends: 103 [2019-11-22 13:58:40,576 INFO L226 Difference]: Without dead ends: 100 [2019-11-22 13:58:40,578 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-22 13:58:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-22 13:58:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-22 13:58:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-22 13:58:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-22 13:58:40,625 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 14 [2019-11-22 13:58:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:40,625 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-22 13:58:40,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:58:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-22 13:58:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-22 13:58:40,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:40,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:58:40,627 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-22 13:58:40,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:40,628 INFO L82 PathProgramCache]: Analyzing trace with hash -115732398, now seen corresponding path program 1 times [2019-11-22 13:58:40,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:40,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776902111] [2019-11-22 13:58:40,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:58:40,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776902111] [2019-11-22 13:58:40,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:58:40,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 13:58:40,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480814916] [2019-11-22 13:58:40,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:58:40,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:40,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:58:40,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:58:40,856 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 8 states. [2019-11-22 13:58:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:41,514 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-22 13:58:41,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:58:41,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-22 13:58:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:41,519 INFO L225 Difference]: With dead ends: 99 [2019-11-22 13:58:41,521 INFO L226 Difference]: Without dead ends: 99 [2019-11-22 13:58:41,522 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-22 13:58:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-22 13:58:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-22 13:58:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-22 13:58:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-11-22 13:58:41,547 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 14 [2019-11-22 13:58:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:41,547 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-11-22 13:58:41,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:58:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-11-22 13:58:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 13:58:41,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:41,551 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:58:41,552 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-22 13:58:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:41,552 INFO L82 PathProgramCache]: Analyzing trace with hash 707263019, now seen corresponding path program 1 times [2019-11-22 13:58:41,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:41,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7030433] [2019-11-22 13:58:41,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:41,729 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-22 13:58:41,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7030433] [2019-11-22 13:58:41,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:58:41,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 13:58:41,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372062260] [2019-11-22 13:58:41,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:58:41,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:41,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:58:41,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:58:41,732 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 8 states. [2019-11-22 13:58:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:42,285 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-22 13:58:42,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:58:42,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-22 13:58:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:42,289 INFO L225 Difference]: With dead ends: 98 [2019-11-22 13:58:42,289 INFO L226 Difference]: Without dead ends: 98 [2019-11-22 13:58:42,290 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-22 13:58:42,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-22 13:58:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-22 13:58:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-22 13:58:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-22 13:58:42,301 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 15 [2019-11-22 13:58:42,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:42,301 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-22 13:58:42,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:58:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-22 13:58:42,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 13:58:42,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:42,303 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-22 13:58:42,303 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-22 13:58:42,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:42,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745985, now seen corresponding path program 1 times [2019-11-22 13:58:42,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:42,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282199761] [2019-11-22 13:58:42,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:42,445 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-22 13:58:42,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282199761] [2019-11-22 13:58:42,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:58:42,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 13:58:42,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699212381] [2019-11-22 13:58:42,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:58:42,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:42,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:58:42,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:58:42,448 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 8 states. [2019-11-22 13:58:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:42,893 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-22 13:58:42,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:58:42,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-22 13:58:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:42,895 INFO L225 Difference]: With dead ends: 96 [2019-11-22 13:58:42,896 INFO L226 Difference]: Without dead ends: 96 [2019-11-22 13:58:42,897 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-22 13:58:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-22 13:58:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-22 13:58:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-22 13:58:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-22 13:58:42,912 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 23 [2019-11-22 13:58:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:42,912 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-22 13:58:42,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:58:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-22 13:58:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 13:58:42,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:42,916 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-22 13:58:42,916 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-22 13:58:42,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:42,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745986, now seen corresponding path program 1 times [2019-11-22 13:58:42,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:42,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782786110] [2019-11-22 13:58:42,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:43,203 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-22 13:58:43,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782786110] [2019-11-22 13:58:43,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:58:43,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 13:58:43,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912727022] [2019-11-22 13:58:43,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 13:58:43,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:43,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 13:58:43,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-22 13:58:43,207 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 11 states. [2019-11-22 13:58:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:44,235 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2019-11-22 13:58:44,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 13:58:44,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-22 13:58:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:44,238 INFO L225 Difference]: With dead ends: 116 [2019-11-22 13:58:44,238 INFO L226 Difference]: Without dead ends: 116 [2019-11-22 13:58:44,239 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-22 13:58:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-22 13:58:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2019-11-22 13:58:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-22 13:58:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-11-22 13:58:44,248 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 23 [2019-11-22 13:58:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:44,249 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-11-22 13:58:44,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 13:58:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-11-22 13:58:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 13:58:44,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:44,250 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-22 13:58:44,250 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-22 13:58:44,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:44,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1149583382, now seen corresponding path program 1 times [2019-11-22 13:58:44,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:44,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72623284] [2019-11-22 13:58:44,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:44,467 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-22 13:58:44,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72623284] [2019-11-22 13:58:44,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:58:44,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-22 13:58:44,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704298238] [2019-11-22 13:58:44,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 13:58:44,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 13:58:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:58:44,474 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 12 states. [2019-11-22 13:58:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:45,425 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2019-11-22 13:58:45,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 13:58:45,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-11-22 13:58:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:45,428 INFO L225 Difference]: With dead ends: 99 [2019-11-22 13:58:45,428 INFO L226 Difference]: Without dead ends: 99 [2019-11-22 13:58:45,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-11-22 13:58:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-22 13:58:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-22 13:58:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-22 13:58:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-11-22 13:58:45,438 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 24 [2019-11-22 13:58:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:45,438 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-11-22 13:58:45,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 13:58:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-11-22 13:58:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 13:58:45,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:45,440 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-22 13:58:45,440 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-22 13:58:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash 943033910, now seen corresponding path program 1 times [2019-11-22 13:58:45,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:45,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60357159] [2019-11-22 13:58:45,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:45,536 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-22 13:58:45,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60357159] [2019-11-22 13:58:45,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:58:45,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 13:58:45,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889348526] [2019-11-22 13:58:45,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:58:45,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:45,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:58:45,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:58:45,539 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2019-11-22 13:58:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:45,920 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-11-22 13:58:45,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:58:45,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-22 13:58:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:45,923 INFO L225 Difference]: With dead ends: 94 [2019-11-22 13:58:45,923 INFO L226 Difference]: Without dead ends: 94 [2019-11-22 13:58:45,923 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-22 13:58:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-22 13:58:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-11-22 13:58:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-22 13:58:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-11-22 13:58:45,929 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 26 [2019-11-22 13:58:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:45,929 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-11-22 13:58:45,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:58:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-11-22 13:58:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 13:58:45,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:45,931 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-22 13:58:45,931 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-22 13:58:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:45,931 INFO L82 PathProgramCache]: Analyzing trace with hash 943033911, now seen corresponding path program 1 times [2019-11-22 13:58:45,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:45,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788789839] [2019-11-22 13:58:45,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,038 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-22 13:58:46,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788789839] [2019-11-22 13:58:46,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:58:46,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 13:58:46,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992384473] [2019-11-22 13:58:46,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:58:46,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:46,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:58:46,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:58:46,040 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 7 states. [2019-11-22 13:58:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:46,407 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-11-22 13:58:46,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:58:46,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-22 13:58:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:46,410 INFO L225 Difference]: With dead ends: 89 [2019-11-22 13:58:46,410 INFO L226 Difference]: Without dead ends: 89 [2019-11-22 13:58:46,411 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-22 13:58:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-22 13:58:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-11-22 13:58:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-22 13:58:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-11-22 13:58:46,416 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 26 [2019-11-22 13:58:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:46,417 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-11-22 13:58:46,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:58:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-11-22 13:58:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 13:58:46,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:46,418 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-22 13:58:46,418 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-22 13:58:46,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:46,419 INFO L82 PathProgramCache]: Analyzing trace with hash 941830451, now seen corresponding path program 1 times [2019-11-22 13:58:46,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:46,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606185553] [2019-11-22 13:58:46,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,498 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-22 13:58:46,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606185553] [2019-11-22 13:58:46,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387481002] [2019-11-22 13:58:46,499 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-22 13:58:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 13:58:46,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:58:46,610 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-22 13:58:46,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:58:46,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2019-11-22 13:58:46,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877538817] [2019-11-22 13:58:46,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 13:58:46,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:46,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 13:58:46,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:58:46,612 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 5 states. [2019-11-22 13:58:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:46,670 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-11-22 13:58:46,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 13:58:46,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-22 13:58:46,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:46,672 INFO L225 Difference]: With dead ends: 112 [2019-11-22 13:58:46,672 INFO L226 Difference]: Without dead ends: 112 [2019-11-22 13:58:46,673 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-22 13:58:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-22 13:58:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2019-11-22 13:58:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-22 13:58:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-11-22 13:58:46,678 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 26 [2019-11-22 13:58:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:46,679 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-11-22 13:58:46,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 13:58:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-11-22 13:58:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-22 13:58:46,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:46,680 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-22 13:58:46,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:58:46,887 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-22 13:58:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:46,887 INFO L82 PathProgramCache]: Analyzing trace with hash -830719863, now seen corresponding path program 1 times [2019-11-22 13:58:46,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:46,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287372209] [2019-11-22 13:58:46,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:46,966 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-22 13:58:46,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287372209] [2019-11-22 13:58:46,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:58:46,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 13:58:46,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926231174] [2019-11-22 13:58:46,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:58:46,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:58:46,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:58:46,970 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 7 states. [2019-11-22 13:58:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:47,242 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-11-22 13:58:47,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:58:47,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-22 13:58:47,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:47,243 INFO L225 Difference]: With dead ends: 88 [2019-11-22 13:58:47,243 INFO L226 Difference]: Without dead ends: 88 [2019-11-22 13:58:47,244 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-22 13:58:47,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-22 13:58:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-22 13:58:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-22 13:58:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-11-22 13:58:47,249 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 27 [2019-11-22 13:58:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:47,249 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-11-22 13:58:47,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:58:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-11-22 13:58:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-22 13:58:47,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:47,250 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-22 13:58:47,250 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-22 13:58:47,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:47,251 INFO L82 PathProgramCache]: Analyzing trace with hash -830719862, now seen corresponding path program 1 times [2019-11-22 13:58:47,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:47,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118365784] [2019-11-22 13:58:47,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:47,324 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-22 13:58:47,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118365784] [2019-11-22 13:58:47,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:58:47,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 13:58:47,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079708222] [2019-11-22 13:58:47,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:58:47,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:47,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:58:47,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:58:47,326 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 7 states. [2019-11-22 13:58:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:47,600 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-11-22 13:58:47,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:58:47,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-22 13:58:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:47,602 INFO L225 Difference]: With dead ends: 83 [2019-11-22 13:58:47,602 INFO L226 Difference]: Without dead ends: 83 [2019-11-22 13:58:47,602 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-22 13:58:47,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-22 13:58:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-22 13:58:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-22 13:58:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-11-22 13:58:47,606 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 27 [2019-11-22 13:58:47,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:47,607 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-11-22 13:58:47,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:58:47,607 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-11-22 13:58:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-22 13:58:47,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:47,608 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-22 13:58:47,608 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-22 13:58:47,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:47,609 INFO L82 PathProgramCache]: Analyzing trace with hash 48801308, now seen corresponding path program 1 times [2019-11-22 13:58:47,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:47,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687971586] [2019-11-22 13:58:47,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:47,697 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-22 13:58:47,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687971586] [2019-11-22 13:58:47,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251407483] [2019-11-22 13:58:47,697 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-22 13:58:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:47,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 13:58:47,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:58:47,761 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-22 13:58:47,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:58:47,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-11-22 13:58:47,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11801183] [2019-11-22 13:58:47,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 13:58:47,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:47,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 13:58:47,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-22 13:58:47,763 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 9 states. [2019-11-22 13:58:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:48,264 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-11-22 13:58:48,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-22 13:58:48,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-22 13:58:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:48,266 INFO L225 Difference]: With dead ends: 122 [2019-11-22 13:58:48,266 INFO L226 Difference]: Without dead ends: 122 [2019-11-22 13:58:48,268 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-22 13:58:48,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-22 13:58:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2019-11-22 13:58:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-22 13:58:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-11-22 13:58:48,282 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 31 [2019-11-22 13:58:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:48,282 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-11-22 13:58:48,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 13:58:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-11-22 13:58:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 13:58:48,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:48,289 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-22 13:58:48,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:58:48,490 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-22 13:58:48,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:48,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1425745197, now seen corresponding path program 2 times [2019-11-22 13:58:48,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:48,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786397670] [2019-11-22 13:58:48,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:48,608 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-22 13:58:48,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786397670] [2019-11-22 13:58:48,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423051485] [2019-11-22 13:58:48,609 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-22 13:58:48,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-22 13:58:48,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-22 13:58:48,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 13:58:48,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:58:48,824 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-22 13:58:48,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:58:48,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-22 13:58:48,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436569158] [2019-11-22 13:58:48,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-22 13:58:48,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:48,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-22 13:58:48,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-22 13:58:48,826 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 17 states. [2019-11-22 13:58:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:50,080 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2019-11-22 13:58:50,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-22 13:58:50,080 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-11-22 13:58:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:50,082 INFO L225 Difference]: With dead ends: 123 [2019-11-22 13:58:50,083 INFO L226 Difference]: Without dead ends: 123 [2019-11-22 13:58:50,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2019-11-22 13:58:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-22 13:58:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 81. [2019-11-22 13:58:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-22 13:58:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-11-22 13:58:50,088 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 36 [2019-11-22 13:58:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:50,088 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-11-22 13:58:50,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-22 13:58:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-11-22 13:58:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-22 13:58:50,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:50,091 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-22 13:58:50,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:58:50,294 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-22 13:58:50,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:50,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1630798574, now seen corresponding path program 1 times [2019-11-22 13:58:50,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:50,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877593407] [2019-11-22 13:58:50,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,409 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-22 13:58:50,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877593407] [2019-11-22 13:58:50,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473750781] [2019-11-22 13:58:50,410 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-22 13:58:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 13:58:50,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:58:50,608 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-22 13:58:50,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:58:50,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2019-11-22 13:58:50,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884031488] [2019-11-22 13:58:50,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:58:50,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:50,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:58:50,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-22 13:58:50,614 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 6 states. [2019-11-22 13:58:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:50,699 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-11-22 13:58:50,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 13:58:50,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-22 13:58:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:50,702 INFO L225 Difference]: With dead ends: 104 [2019-11-22 13:58:50,702 INFO L226 Difference]: Without dead ends: 101 [2019-11-22 13:58:50,705 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-22 13:58:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-22 13:58:50,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2019-11-22 13:58:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-22 13:58:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-11-22 13:58:50,711 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 58 [2019-11-22 13:58:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:50,712 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-11-22 13:58:50,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:58:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-11-22 13:58:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-22 13:58:50,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:50,715 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-22 13:58:50,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:58:50,919 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-22 13:58:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:50,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1652012609, now seen corresponding path program 1 times [2019-11-22 13:58:50,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:50,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118848378] [2019-11-22 13:58:50,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,046 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-22 13:58:51,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118848378] [2019-11-22 13:58:51,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735031152] [2019-11-22 13:58:51,047 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-22 13:58:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 13:58:51,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:58:51,138 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-22 13:58:51,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:58:51,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 9 [2019-11-22 13:58:51,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356184465] [2019-11-22 13:58:51,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:58:51,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:51,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:58:51,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-22 13:58:51,140 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 7 states. [2019-11-22 13:58:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:51,191 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-11-22 13:58:51,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 13:58:51,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-11-22 13:58:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:51,192 INFO L225 Difference]: With dead ends: 86 [2019-11-22 13:58:51,192 INFO L226 Difference]: Without dead ends: 76 [2019-11-22 13:58:51,193 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-22 13:58:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-22 13:58:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-22 13:58:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-22 13:58:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-11-22 13:58:51,196 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 61 [2019-11-22 13:58:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:51,197 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-11-22 13:58:51,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:58:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-11-22 13:58:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-22 13:58:51,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:51,198 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-22 13:58:51,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:58:51,402 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-22 13:58:51,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash -35663204, now seen corresponding path program 1 times [2019-11-22 13:58:51,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:51,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690002600] [2019-11-22 13:58:51,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:51,583 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-22 13:58:51,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690002600] [2019-11-22 13:58:51,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:58:51,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 13:58:51,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713711] [2019-11-22 13:58:51,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 13:58:51,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:51,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 13:58:51,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-22 13:58:51,586 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 12 states. [2019-11-22 13:58:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:52,182 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-22 13:58:52,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 13:58:52,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-11-22 13:58:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:52,184 INFO L225 Difference]: With dead ends: 76 [2019-11-22 13:58:52,184 INFO L226 Difference]: Without dead ends: 76 [2019-11-22 13:58:52,185 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-22 13:58:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-22 13:58:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-22 13:58:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-22 13:58:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-11-22 13:58:52,189 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 64 [2019-11-22 13:58:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:52,191 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-22 13:58:52,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 13:58:52,191 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-11-22 13:58:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-22 13:58:52,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:52,192 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-22 13:58:52,192 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-22 13:58:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:52,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1633609241, now seen corresponding path program 1 times [2019-11-22 13:58:52,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:52,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61136273] [2019-11-22 13:58:52,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:52,447 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-22 13:58:52,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61136273] [2019-11-22 13:58:52,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364473954] [2019-11-22 13:58:52,448 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-22 13:58:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:52,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 13:58:52,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:58:52,545 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-22 13:58:52,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:58:52,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 16 [2019-11-22 13:58:52,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861873491] [2019-11-22 13:58:52,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 13:58:52,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:52,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 13:58:52,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-11-22 13:58:52,548 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2019-11-22 13:58:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:52,589 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-22 13:58:52,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:58:52,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-22 13:58:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:52,591 INFO L225 Difference]: With dead ends: 76 [2019-11-22 13:58:52,591 INFO L226 Difference]: Without dead ends: 75 [2019-11-22 13:58:52,592 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-22 13:58:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-22 13:58:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-22 13:58:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-22 13:58:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-11-22 13:58:52,595 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 66 [2019-11-22 13:58:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:52,595 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-11-22 13:58:52,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 13:58:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-11-22 13:58:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-22 13:58:52,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:52,596 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-22 13:58:52,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:58:52,801 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-22 13:58:52,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:52,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1616930628, now seen corresponding path program 1 times [2019-11-22 13:58:52,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:52,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689053968] [2019-11-22 13:58:52,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:53,332 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-22 13:58:53,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689053968] [2019-11-22 13:58:53,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015428739] [2019-11-22 13:58:53,334 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-22 13:58:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:53,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-22 13:58:53,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:58:53,527 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-22 13:58:53,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:58:53,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:53,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:58:53,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-22 13:58:53,714 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-22 13:58:53,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:58:53,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:53,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:58:53,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-22 13:58:53,778 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:53,779 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-22 13:58:53,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:53,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:58:53,814 INFO L567 ElimStorePlain]: treesize reduction 16, result has 68.6 percent of original size [2019-11-22 13:58:53,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:53,817 INFO L496 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-22 13:58:53,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:36 [2019-11-22 13:58:53,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:53,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:53,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:54,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:54,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:58:54,844 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-22 13:58:54,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:58:54,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:54,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:58:54,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-11-22 13:58:54,950 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-22 13:58:54,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:58:54,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [21] total 36 [2019-11-22 13:58:54,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595558407] [2019-11-22 13:58:54,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-22 13:58:54,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:54,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-22 13:58:54,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2019-11-22 13:58:54,953 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 17 states. [2019-11-22 13:58:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:57,973 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-22 13:58:57,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-22 13:58:57,973 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-11-22 13:58:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:57,975 INFO L225 Difference]: With dead ends: 78 [2019-11-22 13:58:57,975 INFO L226 Difference]: Without dead ends: 78 [2019-11-22 13:58:57,976 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-22 13:58:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-22 13:58:57,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-22 13:58:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-22 13:58:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-11-22 13:58:57,979 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 68 [2019-11-22 13:58:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:57,979 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-11-22 13:58:57,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-22 13:58:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-11-22 13:58:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-22 13:58:57,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:57,980 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-22 13:58:58,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:58:58,184 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-22 13:58:58,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:58,185 INFO L82 PathProgramCache]: Analyzing trace with hash 907828895, now seen corresponding path program 1 times [2019-11-22 13:58:58,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:58,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883710066] [2019-11-22 13:58:58,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:58,411 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-22 13:58:58,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883710066] [2019-11-22 13:58:58,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:58:58,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 13:58:58,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678396341] [2019-11-22 13:58:58,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 13:58:58,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:58:58,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 13:58:58,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-22 13:58:58,413 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 13 states. [2019-11-22 13:58:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:58:59,303 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2019-11-22 13:58:59,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 13:58:59,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-11-22 13:58:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:58:59,306 INFO L225 Difference]: With dead ends: 126 [2019-11-22 13:58:59,306 INFO L226 Difference]: Without dead ends: 126 [2019-11-22 13:58:59,306 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-22 13:58:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-22 13:58:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2019-11-22 13:58:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-22 13:58:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-11-22 13:58:59,311 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 70 [2019-11-22 13:58:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:58:59,312 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-11-22 13:58:59,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 13:58:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-11-22 13:58:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-22 13:58:59,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:58:59,313 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-22 13:58:59,313 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-22 13:58:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:58:59,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1554600484, now seen corresponding path program 1 times [2019-11-22 13:58:59,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:58:59,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056937256] [2019-11-22 13:58:59,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:58:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:59,761 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-22 13:58:59,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056937256] [2019-11-22 13:58:59,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028980618] [2019-11-22 13:58:59,762 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-22 13:58:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:58:59,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 13:58:59,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:58:59,882 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-22 13:58:59,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:58:59,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:59,890 INFO L496 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-22 13:58:59,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-22 13:58:59,953 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-22 13:58:59,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:58:59,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:58:59,955 INFO L496 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-22 13:58:59,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-22 13:59:00,086 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 13:59:00,086 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-22 13:59:00,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:00,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:00,097 INFO L496 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-22 13:59:00,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 13:59:00,239 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 13:59:00,239 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-22 13:59:00,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:00,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:00,252 INFO L496 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-22 13:59:00,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 13:59:00,386 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 13:59:00,387 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-22 13:59:00,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:00,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:00,401 INFO L496 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-22 13:59:00,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 13:59:00,543 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 13:59:00,544 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-22 13:59:00,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:00,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:00,555 INFO L496 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-22 13:59:00,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 13:59:00,664 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 13:59:00,665 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-22 13:59:00,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:00,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:00,679 INFO L496 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-22 13:59:00,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 13:59:00,797 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 13:59:00,798 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-22 13:59:00,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:00,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:00,809 INFO L496 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-22 13:59:00,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 13:59:00,967 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-22 13:59:00,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:59:00,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-11-22 13:59:00,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452481584] [2019-11-22 13:59:00,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 13:59:00,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:00,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 13:59:00,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-11-22 13:59:00,970 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 9 states. [2019-11-22 13:59:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:01,598 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-22 13:59:01,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:59:01,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-11-22 13:59:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:01,600 INFO L225 Difference]: With dead ends: 118 [2019-11-22 13:59:01,600 INFO L226 Difference]: Without dead ends: 83 [2019-11-22 13:59:01,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 15 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-11-22 13:59:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-22 13:59:01,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-22 13:59:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-22 13:59:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-11-22 13:59:01,605 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 80 [2019-11-22 13:59:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:01,605 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-11-22 13:59:01,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 13:59:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-11-22 13:59:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-22 13:59:01,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:01,607 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-22 13:59:01,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:01,811 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-22 13:59:01,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:01,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1047974994, now seen corresponding path program 1 times [2019-11-22 13:59:01,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:01,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223091339] [2019-11-22 13:59:01,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:02,210 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-22 13:59:02,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223091339] [2019-11-22 13:59:02,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616834812] [2019-11-22 13:59:02,211 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-22 13:59:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:02,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-22 13:59:02,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:02,828 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-22 13:59:02,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:02,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:02,837 INFO L496 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-22 13:59:02,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-11-22 13:59:03,531 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-22 13:59:03,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:59:03,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:59:03,544 INFO L496 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-22 13:59:03,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-11-22 13:59:03,619 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-22 13:59:03,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:03,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2019-11-22 13:59:03,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522805844] [2019-11-22 13:59:03,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-22 13:59:03,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:03,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-22 13:59:03,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2019-11-22 13:59:03,622 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 31 states. [2019-11-22 13:59:06,761 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-22 13:59:07,984 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-22 13:59:08,773 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-11-22 13:59:09,085 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-22 13:59:09,597 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-11-22 13:59:10,158 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-22 13:59:10,741 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-11-22 13:59:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:11,236 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2019-11-22 13:59:11,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-22 13:59:11,236 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 83 [2019-11-22 13:59:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:11,237 INFO L225 Difference]: With dead ends: 117 [2019-11-22 13:59:11,237 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 13:59:11,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=458, Invalid=3448, Unknown=0, NotChecked=0, Total=3906 [2019-11-22 13:59:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 13:59:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 13:59:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 13:59:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 13:59:11,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-11-22 13:59:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:11,240 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 13:59:11,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-22 13:59:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 13:59:11,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 13:59:11,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:11,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:59:11 BoogieIcfgContainer [2019-11-22 13:59:11,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 13:59:11,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 13:59:11,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 13:59:11,453 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 13:59:11,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:58:39" (3/4) ... [2019-11-22 13:59:11,457 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 13:59:11,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 13:59:11,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mkdup [2019-11-22 13:59:11,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure finddup [2019-11-22 13:59:11,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 13:59:11,467 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-22 13:59:11,467 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-22 13:59:11,474 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-11-22 13:59:11,475 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-22 13:59:11,475 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-22 13:59:11,476 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 13:59:11,542 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 13:59:11,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 13:59:11,543 INFO L168 Benchmark]: Toolchain (without parser) took 33372.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 408.9 MB). Free memory was 957.7 MB in the beginning and 1.4 GB in the end (delta: -428.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 13:59:11,544 INFO L168 Benchmark]: CDTParser took 0.26 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-22 13:59:11,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:11,545 INFO L168 Benchmark]: Boogie Preprocessor took 47.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:11,545 INFO L168 Benchmark]: RCFGBuilder took 604.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:11,545 INFO L168 Benchmark]: TraceAbstraction took 32260.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 285.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -306.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 13:59:11,546 INFO L168 Benchmark]: Witness Printer took 89.17 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 457.6 kB). Peak memory consumption was 457.6 kB. Max. memory is 11.5 GB. [2019-11-22 13:59:11,548 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 604.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32260.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 285.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -306.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 89.17 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 457.6 kB). Peak memory consumption was 457.6 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: 32.1s, OverallIterations: 21, TraceHistogramMax: 5, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1220 SDtfs, 2611 SDslu, 3582 SDs, 0 SdLazy, 7643 SolverSat, 799 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1030 GetRequests, 616 SyntacticMatches, 33 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 11.8s 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.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 155 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.9s 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...